棒球问题得分情况

一个采购

于 2024-01-04 16:58:13 发布

阅读量486

点赞数 10

文章标签：算法 leetcode 数据结构

本文链接：https://blog.csdn.net/m0_57158553/article/details/135391198

版权

class Solution
{
public:
    int calPoints(vector<string> &operations)
    {
        vector<int> nums(operations.size());
        int j = 0;
        for (int i = 0; i < operations.size(); i++)
        {
            /* code */
            int k = 0;
            char ch = operations[i][0];
            string tempstr = "";
            if (operations[i].size() > 1)
            {
                if (ch=='-')
                {
                    for (int q = 1; q < operations[i].size(); q++)
                    {
                        tempstr+=operations[i][q];
                    }
                    k=-(atoi(tempstr.c_str()));
                }else{
                    for (int q = 0; q < operations[i].size(); q++)
                    {
                        tempstr+=operations[i][q];
                    }
                    k=(atoi(tempstr.c_str()));

                }
                
            }
            else
            {
                k=ch-'0';
            }

            if (ch == '+')
            {
                nums[j++] = nums[j - 1] + nums[j - 2];
            }
            else if (ch == 'D')
            {
                nums[j++] = nums[j - 1] * 2;
            }
            else if (ch == 'C')
            {
                nums.erase(nums.begin() + (j - 1));
                j--;
            }
            else
            {
                nums[j++] = k;
            }
        }
        int sum = 0;
        for (int i = 0; i < nums.size(); i++)
        {
            /* code */
            sum += nums[i];
            cout << nums[i] << " ";
        }
        return sum;
    }
};