leetcode -- String to Integer (atoi)

The function first discards as many whitespace characters as necessary until the first non-whitespace character is found. Then, starting from this character, takes an optional initial plus or minus sign followed by as many numerical digits as possible, and interprets them as a numerical value.

The string can contain additional characters after those that form the integral number, which are ignored and have no effect on the behavior of this function.

If the first sequence of non-whitespace characters in str is not a valid integral number, or if no such sequence exists because either str is empty or it contains only whitespace characters, no conversion is performed.

If no valid conversion could be performed, a zero value is returned. If the correct value is out of the range of representable values, INT_MAX (2147483647) or INT_MIN (-2147483648) is returned.

[解题思路]

处理特殊情况，并且long long处理方便好多，但是我比较喜欢使用int实现

 1 int Solution::atoi(const char *str)
 2 {
 3     int flag = 1, start = 0, ans = 0, ismax = 0;
 4     for (start = 0; str[start] == ‘ ‘; start ++);
 5     if (str[start] == ‘\0‘)
 6         return ans;
 7     if (str[start] == ‘-‘)
 8         flag = -1, start ++;
 9     else if (str[start] == ‘+‘)
10         flag = 1, start ++;
11     if (str[start] > ‘9‘ || str[start] < ‘0‘)
12         return 0;
13     for (; str[start] <= ‘9‘&&str[start] >= ‘0‘&&str[start] != ‘\0‘; start ++){
14         if (ans > 214748364
15             || (flag == 1&&ans==214748364&&(str[start]<‘0‘||str[start]>‘7‘))
16             || (flag == -1&&ans==214748364&&(str[start]<‘0‘||str[start]>‘8‘))){
17             ismax = 1;
18             break;
19         }
20         ans *= 10;
21         ans += (str[start] - ‘0‘);
22     }
23     return ismax == 1?(flag == 1?(2147483647):(-2147483648)):(ans*flag);
24 }