博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
leetcode-682-Baseball Game
阅读量:6435 次
发布时间:2019-06-23

本文共 2687 字,大约阅读时间需要 8 分钟。

题目描述:

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: 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:

  • The size of the input list will be between 1 and 1000.
  • Every integer represented in the list will be between -30000 and 30000.

 

要完成的函数:

int calPoints(vector<string>& ops) 

 

说明:

1、翻译一下题意,你是一个棒球记分员,要你输出最后的总分。

给定一个vector,里面装着每一轮的操作,操作是string类型的。

如果操作是D,也就是当前轮次的得分是上一轮(有效)的得分乘以2。

如果操作是+,也就是当前轮次的得分是上一轮(有效)和再上一轮(有效)的得分之和。

如果操作是C,也就是当前轮次没有得分,而且上一轮得分宣告无效。

如果操作是一个整数,该整数也就是当前轮次的得分。

 

以一个例子来走一趟整个流程,["5","-2","4","C","D","9","+","+"]

第一个数,此轮得分5,总分5

第二个数,此轮得分-2,总分3

第三个数,此轮得分4,总分7

第四个数,C,上一轮得分4无效,总分3

第五个数,D,上一轮(有效)得分为-2,所以此轮次得分-4,总分-1

第六个数,此轮得分9,总分8

第七个数,+,上一轮(有效)得分9,再上一轮(有效)得分-4,所以此轮得分5,总分13

第八个数,+,上一轮(有效)得分5,再上一轮(有效)得分9,所以此轮得分14,总分27

 

逻辑清晰,我们构造如下代码:

int calPoints(vector
& ops) { int sum=0; stack
cur;//存储每一次的此轮得分 int s1=ops.size(); int result;//中间变量 int t;//中间变量 int t1,t2;//中间变量 for(int i=0;i

笔者觉得上述代码没有多少浪费的地方。实测效果也还可以,6ms,beats 98.60% of cpp submissions。

如果同学们觉得还有可以改进的地方,欢迎在评论区中留言!

转载于:https://www.cnblogs.com/chenjx85/p/9026876.html

你可能感兴趣的文章
HttpFileCollection类
查看>>
Eclipse使用常见设置
查看>>
控制台下的字符图像界面
查看>>
c++ 数组形参
查看>>
Memcache的安全
查看>>
KVM/Xen and libvirt: currentMemory, memory and ballooning
查看>>
metasploit 笔记
查看>>
hdu 2845(最大不连续子序列)
查看>>
J2me的异常处理和多线程
查看>>
选择、生成-EA与数据库的交互-by小雨
查看>>
客户网页WIZnet无线解决方案 之 太阳能逆变器
查看>>
CCRepeatForever和CCDelayTime
查看>>
android jni aotf 错误
查看>>
Azkaban的功能特点(二)
查看>>
[RxJS] Add debug method to Observable in TypeScript
查看>>
1、金融之关于BIAS
查看>>
[转]ASP.NET Core基本原理(11)-管理应用程序状态
查看>>
VS Code搭建.NetCore开发环境(一)
查看>>
01字典树贪心查询+建立+删除(个人模版)
查看>>
java-信息安全(十一)-非对称加密算法ECC以及ECDSA签名
查看>>