# LWC 51：682. Baseball Game

## LWC 51：682. Baseball Game

Problem:

You’re now a baseball game point recorder. Given a list of strings, each string can be one of the 4 following types:

1. Integer (one round’s score): Directly represents the number of points you get in this round.
2. “+” (one round’s score): Represents that the points you get in this round are the sum of the last two valid round’s points.
3. “D” (one round’s score): Represents that the points you get in this round are the doubled data of the last valid round’s points.
4. “C” (an operation, which isn’t a round’s score): Represents the last valid round’s points you get were invalid and should be removed. Each round’s operation is permanent and could have an impact on the round before and the round after.

You need to return the sum of the points you could get in all the rounds.

Example 1:

Input: [“5”,”2”,”C”,”D”,”+”] Output: 30 Explanation: Round 1: You could get 5 points. The sum is: 5. Round 2: You could get 2 points. The sum is: 7. Operation 1: The round 2’s data was invalid. The sum is: 5. Round 3: You could get 10 points (the round 2’s data has been removed). The sum is: 15. Round 4: You could get 5 + 10 = 15 points. The sum is: 30.

Example 2:

Input: [“5”,”-2”,”4”,”C”,”D”,”9”,”+”,”+”] Output: 27 Explanation: Round 1: You could get 5 points. The sum is: 5. Round 2: You could get -2 points. The sum is: 3. Round 3: You could get 4 points. The sum is: 7. Operation 1: The round 3’s data is invalid. The sum is: 3. Round 4: You could get -4 points (the round 3’s data has been removed). The sum is: -1. Round 5: You could get 9 points. The sum is: 8. Round 6: You could get -4 + 9 = 5 points. The sum is 13. Round 7: You could get 9 + 5 = 14 points. The sum is 27.

Note:

The size of the input list will be between 1 and 1000.

Every integer represented in the list will be between -30000 and 30000.

```    public int calPoints(String[] ops) {
List<Integer> ans = new ArrayList<>();
for (int i = 0; i < ops.length; ++i) {
String val = ops[i];
if (val.equals("C")) {
ans.remove(ans.size() - 1);
}
else if (val.equals("D")) {
int last = ans.get(ans.size() - 1);
}
else if (val.equals("+")) {
int last = ans.get(ans.size() - 1);
int prev = ans.get(ans.size() - 2);
}
else {
int num = Integer.parseInt(val);
}
}

int sum = 0;
for (int i = 0; i < ans.size(); ++i) {
sum += ans.get(i);
}
return sum;
}```

```    public int calPoints(String[] ops) {
int n = ops.length;
int[] list = new int[n + 1];
int tot = 0;
for (int i = 0; i < n; ++i) {
String val = ops[i];
if (val.equals("C")) {
tot--;
}
else if (val.equals("D")) {
int lst = list[tot - 1];
list[tot++] = lst * 2;
}
else if (val.equals("+")) {
int lst = list[tot - 1];
int prv = list[tot - 2];
list[tot++] = lst + prv;
}
else {
int num = Integer.parseInt(val);
list[tot++] = num;
}
}

int sum = 0;
for (int i = 0; i < tot; ++i) {
sum += list[i];
}

return sum;
} ```

98 篇文章33 人订阅

0 条评论

## 相关文章

### 3212: Pku3468 A Simple Problem with Integers

3212: Pku3468 A Simple Problem with Integers Time Limit: 1 Sec  Memory Limit: 12...

3218

### 《eloquent javascript》 notes1

There is only one value in JavaScript that is not equal to itself, and that is N...

893

### 聊聊rocketmq的FileAppender

org/apache/rocketmq/logging/inner/LoggingBuilder.java

561

1、dirver package com.kangaroo.hadoop.drive; import java.util.Map; import java.u...

6415

792

### 聊聊springboot2的LoggersEndpoint

spring-boot-actuator-autoconfigure-2.0.1.RELEASE-sources.jar!/org/springframewor...

1182

### HDU 5675 ztr loves math

ztr loves math Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65...

3956

1081

### 聊聊storm client的nimbus.seeds参数

storm-core-1.1.0-sources.jar!/org/apache/storm/Config.java

1082

### Go 语言结构体

Go 语言中数组可以存储同一类型的数据，但在结构体中我们可以为不同项定义不同的数据类型。 结构体是由一系列具有相同类型或不同类型的数据构成的数据集合。 结构体表...

2837 