int myAtoi(char* str) {
int length = strlen(str);
int ret=0;
int i=0;
bool handle_flag=true;
int plus_flag=0;
int minus_flag=0;
int ch=0;
long ch_long=0;
while(str[i] != '\0') {
if (handle_flag) { // 处理数字前面的负号、正号、空格,leetcode限制了太多所以这块写的有点乱
if (str[i]=='-')
{
minus_flag++;
if (str[i+1] == ' ' || str[i+1] == '-') return 0;
}
if (str[i]=='+')
{
plus_flag++;
if (str[i+1] == ' ' || str[i+1] == '+') return 0;
}
if (str[i]!=' ' && str[i]!='-' &&str[i]!='+') {
handle_flag=false;
continue;
}
} else { // 处理数字
if (str[i] > '9' || str[i] < '0')
break;
ch=str[i]-'0';
if (ret > (INT_MAX-ch)/10 ) { // 假设ret*10+ch=INT_MAX, 如果加之前ret较大, 则返回INT_MIN INT_MAX。如果发现下一步的加法会产生溢出,则直接return 最大值
if ((minus_flag-plus_flag) > 0) {
return INT_MIN;
} else {
return INT_MAX;
}
}
ret = ret*10 + ch;
}
i++;
}
if ((minus_flag-plus_flag) > 0) {
ret=(-1)*ret;
}
if (minus_flag = plus_flag && minus_flag > 0)
ret=0;
return ret;
}