Baseball Game LeetCode solution in C++

1
class Solution {
2
 public:
3
  int calPoints(vector<string> &ops) {
4
    stack<int> st;
5
    int n = ops.size();
6
    for (int i = 0; i < n; i++) {
7
      if (ops[i] == "C") {
8
        st.pop();
9
      } else if (ops[i] == "D") {
10
        st.push(st.top() * 2);
11
      } else if (ops[i] == "+") {
12
        int temp = st.top();
13
        st.pop();
14
        int temp2 = st.top();
15
        st.push(temp);
16
        st.push(temp + temp2);
17
      } else {
18
        st.push(stoi(ops[i]));
19
      }
20
    }
21
    int res = 0;
22
    while (!st.empty()) {
23
      res += st.top();
24
      st.pop();
25
    }
26
    return res;
27
  }
28
};