题目
难度:困难
类型:递归 栈
class Solution {
public:
int calculate(string s) {
int j = 0;
for(int i = 0; i < s.size(); ){
while(i < s.size() && s[i]==' ') i++;
while(i < s.size
题目
难度:困难
类型:递归 栈
class Solution {
public:
int calculate(string s) {
int j = 0;
for(int i = 0; i < s.size(); ){
while(i < s.size() && s[i]==' ') i++;
while(i < s.size