aaa
作者:
浩然正气
,
2022-09-06 06:59:51
,
所有人可见
,
阅读 204
class Solution
{
public:
int strToInt(string str)
{
int len = str.length();
int k = 0;
while((k < len) && (str[k] == ' '))
k ++;
long long int res = 0;
int mins = 1;
if(k < len)
{
if(str[k] == '-')
{
mins = -1;
k ++;
}
else if(str[k] == '+')
k ++;
}
while((k < len) && (str[k] >= '0' && str[k] <= '9'))
{
res = (res * 10) + (str[k] - '0');
if(res > 1e+11)
break;
k ++;
}
res = res * mins;
if(res > INT_MAX)
res = INT_MAX;
if(res < INT_MIN)
res = INT_MIN;
return res;
}
};