Problem:
You’re now a baseball game point recorder.
Given a list of strings, each string can be one of the 4 following types:
Integer(one round’s score): Directly represents the number of points you get in this round."+"(one round’s score): Represents that the points you get in this round are the sum of the last twovalidround’s points."D"(one round’s score): Represents that the points you get in this round are the doubled data of the lastvalidround’s points."C"(an operation, which isn’t a round’s score): Represents the lastvalidround’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:
|
1 2 3 4 5 6 7 8 |
Input: ["5","2","C","D","+"] Output: 15 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:
|
1 2 3 4 5 6 7 8 9 10 11 |
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.
Idea:
Simulation
Solution:
C++:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 |
class Solution { public: int calPoints(vector<string>& ops) { vector<int> s; int sum = 0; for (const string& op : ops) { if (op == "+") s.push_back(s.end()[-1] + s.end()[-2]); else if (op == "C") s.pop_back(); else if (op == "D") s.push_back(s.back() * 2); else s.push_back(stoi(op)); } return accumulate(s.begin(), s.end(), 0); } }; |
Java:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 |
class Solution { public int calPoints(String[] ops) { List<Integer> s = new ArrayList<Integer>(); for (String op : ops) { int n = s.size(); if (op.equals("+")) s.add(s.get(n - 1) + s.get(n - 2)); else if (op.equals("C")) s.remove(n - 1); else if (op.equals("D")) s.add(s.get(n - 1) * 2); else s.add(Integer.parseInt(op)); } return s.stream().reduce(0, Integer::sum); } } |
Python
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 |
class Solution: def calPoints(self, ops): """ :type ops: List[str] :rtype: int """ s = [] for op in ops: if op == "+": s += [s[-1] + s[-2]] elif op == "C": s = s[:-1] elif op == "D": s += [s[-1]*2] else: s += [int(op)] return sum(s) |
请尊重作者的劳动成果，转载请注明出处！花花保留对文章／视频的所有权利。
如果您喜欢这篇文章／视频，欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
Paypal
Venmo
huahualeetcode
huahualeetcode
微信打赏
Be First to Comment