[c++]LeetCode#8. String to Integer (atoi)

Implement atoi which converts a string to an integer.

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.

Note:

Only the space character ’ ’ is considered as whitespace character.
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. If the numerical value is out of the range of representable values, INT_MAX (231 − 1) or INT_MIN (−231) is returned.
Example 1:

Input: “42”
Output: 42

Example 2:

Input: " -42"
Output: -42
Explanation: The first non-whitespace character is ‘-’, which is the minus sign.Then take as many numerical digits as possible, which gets 42.

Example 3:

Input: “4193 with words”
Output: 4193
Explanation: Conversion stops at digit ‘3’ as the next character is not a numerical digit.

Example 4:

Input: “words and 987”
Output: 0
Explanation: The first non-whitespace character is ‘w’, which is not a numerical digit or a +/- sign. Therefore no valid conversion could be performed.

Example 5:

Input: “-91283472332”
Output: -2147483648
Explanation: The number “-91283472332” is out of the range of a 32-bit signed integer. Thefore INT_MIN (−231) is returned.

**思路：*先找到首位非空格下标，然后判断是正负号或字母或数字，然后遍历数字部分，需要注意的就是判断溢出，之前有道LeetCode的题跟这个差不多，做法就是在让ans10+t之前判断是否超过INT_MAX/INT_MIN，溢出则直接返回最大最小值

class Solution {
public:
    int myAtoi(string s) {
        int len = s.length();
        if (len < 1) return 0;
        int ans = 0, i = 0;
        for (i = 0; i < len; i++) {		//吃掉空格
            if (s[i] != ' ')
                break;
        }
        int ng = 0;
        if (s[i] == '-') {
            ng = 1;
            i++;
        } else if (s[i] == '+') {
            i++;
        } else if (s[i] >= '0' && s[i] <= '9') {
            ans = s[i++] - '0'; 
        } else return 0;
        if (ng) ans = 0 - ans;
        while (i < len && s[i] >= '0' && s[i] <= '9') {
            int t = s[i] - '0';
            if (!ng && ans <= (INT_MAX -t) / 10)	//正数溢出判断，别忘了等于号
                ans = ans * 10 + t;
            else if (ng && ans >= (INT_MIN + t) / 10)	//负数
                ans = ans * 10 - t;
            else {
                if (ng) return INT_MIN;
                else return INT_MAX;
            }
            i++;
        }
        return ans;
    }
};

我的代码还是不够简洁，看着就让人心烦，包括多出的正负判断应该都是可以优化的，不过暂时就这样吧，程序跑起来比什么都强。