int calPoints(char** operations, int operationsSize) {
if(0>=operationsSize)
{
return 0;
}
int stack[operationsSize];
int top=-1;
int sum=0;
for(int i=0;i<operationsSize;i++)
{
switch(operations[i][0])
{
case'+':
stack[++top]=stack[top]+stack[top-1];
sum=sum+stack[top];
break;
case'D':
stack[++top]=stack[top]*2;
sum=sum+stack[top];
break;
case'C':
sum=sum-stack[top--];
break;
default:
stack[++top]=atoi(operations[i]);
sum=sum+stack[top];
}
}
return sum;
}
力扣栈题:棒球比赛
最新推荐文章于 2024-07-26 13:24:37 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)