https://leetcode-cn.com/problems/ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof/
思路:模拟。
class Solution {
public:
using ll=long long;
int strToInt(string s) {
int i=0,len=s.size();
while(i<len&&s[i]==' ')
i++;
int f=1;
ll ans=0;
ll MAX=(1ll<<31)-1;
ll MIN=-(1ll<<31);
if(s[i]=='+'||s[i]=='-')
f=s[i]=='+'?1:-1,i++;
while(i<len&&s[i]>='0'&&s[i]<='9'&&ans>MIN&&ans<MAX)
ans=ans*10+s[i]-'0',i++;
ans*=f;
if(ans<MIN)
ans=MIN;
else if(ans>MAX)
ans=MAX;
return ans;
}
};