LeetCode.682 Baseball Game
来源:互联网 发布:淘宝客佣金结算时间 编辑:程序博客网 时间:2024/05/16 14:32
题目:
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 twovalid
round's points."D"
(one round's score): Represents that the points you get in this round are the doubled data of the lastvalid
round's points."C"
(an operation, which isn't a round's score): Represents the lastvalid
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: 30Explanation: 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: 27Explanation: 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:
class Solution { public int calPoints(String[] ops) { //给定字符串数组,每个对应的关系如题上所述,你需要返回最后的得分之和 //思路:使用数组实现 if (ops.length == 0) return 0; int sum = 0; int[] nums = new int[ops.length]; //和数组中的游标 int index = 0; for (int i = 0; i < ops.length; i++) { //取第一个符号 char op = ops[i].toCharArray()[0]; switch (op) { case '+': //两和相加 int numP=nums[index - 1] + nums[index - 2]; nums[index++] = numP; break; case 'D': int numD=nums[index-1]*2; nums[index++] = numD; break; case 'C': nums[--index] = 0; break; default: //数字 nums[index++] = Integer.parseInt(ops[i]); break; } } //将结果求和 for (int j = 0; j < nums.length; j++) { sum += nums[j]; } return sum; }}
分析2(原创-易理解):
class Solution { public int calPoints(String[] ops) { //给定字符串数组,每个对应的关系如题上所述,你需要返回最后的得分之和 //思路:使用一个stack来记录每回合的得分 if(ops.length==0) return 0; Stack <Integer>stack=new Stack<>(); int sum=0; for(int i=0;i<ops.length;i++){ //负数的情况,长度为2 if(ops[i].length()==2){ sum+=Integer.parseInt(ops[i]); stack.push(Integer.parseInt(ops[i])); }else{ //字母的情况 //加倍 if(ops[i].equals("D")){ if(!stack.empty()){ //取栈顶元素,并不将其剔除 int score=stack.peek()*2; sum+=score; //重新入栈 stack.push(score); } }else if(ops[i].equals("C")){ //移除栈顶元素 if(!stack.empty()){ //减去一个元素 sum-=stack.pop(); } } else if(ops[i].equals("+")){ //相加 int lastNum=stack.pop(); //另一个需要相加的数不取出 int temp=lastNum+stack.peek(); sum+=temp; //入栈 stack.push(lastNum); stack.push(temp); }else{ //正数 sum+=Integer.parseInt(ops[i]); stack.push(Integer.parseInt(ops[i])); } } } return sum; }}
阅读全文
0 0
- LeetCode.682 Baseball Game
- [LeetCode] 682. Baseball Game
- leetcode 682. Baseball Game
- <LeetCode>682. Baseball Game
- Leetcode. 682. Baseball Game
- Baseball Game(leetcode)
- 【LeetCode】682. Baseball Game
- leetcode 682. Baseball Game
- leetcode Baseball Game 篮球游戏
- LeetCode 682. Baseball Game (Easy)
- Baseball Game
- Leetcode——682. Baseball Game(模拟)
- LeeCode- Baseball Game
- python--leetcode682. Baseball Game
- LeetCode682. Baseball Game
- 682. Baseball Game
- 682. Baseball Game
- 682. Baseball Game
- 广搜法做暴力的奥数题
- CodeForces
- 给定N中物品和一个背包。物品i的重量是Wi,其价值位Vi ,背包的容量为C。问应该如何选择装入背包的物品,使得转入背包的物品的总价值为最大?对每种物品i只有两种选择,即装入背包和不装入背包
- 非模态对话框和模态对话框_创建
- Vue.js源码解析(九)【从template到DOM(Vue.js源码角度看内部运行机制)】
- LeetCode.682 Baseball Game
- Android 简易 自定义ImageView 实现圆形头像
- JDK开发webservice客户端和服务端 demo
- SpringMVC了解
- 支付宝支付的服务端接入流程
- 1.1 Hello, World!
- 修改Eclipse中package explore中字体
- 一个ArcGIS实验
- Spark学习笔记(转)