leetcode String to Integer (atoi)

题目

Implement atoi to convert a string to an integer.

Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cases.

Notes: It is intended for this problem to be specified vaguely (ie, no given input specs). You are responsible to gather all the input requirements up front.

Update (2015-02-10):
The signature of the C++ function had been updated. If you still see your function signature accepts a const char * argument, please click the reload button to reset your code definition.

spoilers alert… click to show requirements for atoi.

Requirements for 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.

题目来源：https://leetcode.com/problems/string-to-integer-atoi/

分析

实现atoi函数，即类似字符串“1234”转成整型1234。
1. 字符串中前面有可能含有若干个空格（如” 1234”），直接忽略前面的空格；
2. 字符串后面有可能含有若干个非数字字符（如”1234abc5”），直接忽略4后面的所有字符；
3. 滤除前面的空格之后，没有发现数字字符（如” “），则不予转化，返回0；
4. 如果字符串表示的数字转化为整型后会超出范围，返回机器所能表示的最大整数INT_MAX 或者INT_MIN。

代码

class Solution {
public:
    int myAtoi(string str) {
        int len = str.length();
        bool plus_flag = true;//正数的标识，没有正负号默认为正数。
        int i = 0;
        while(i < len){//滤除前面的空格字符
            if(str.at(i) != ' ')
                break;
            i++;
        }
        if(i >= len)//如果str中只有空格
            return 0;
        else if(str.at(i) == '+'){//带‘﹢’字符
            plus_flag = true;
            i++;
        }
        else if(str.at(i) == '-'){//负号
            plus_flag = false;
            i++;
        }
        else{}
        int num_start = i;
        int num_end = i;
        while(i < len){//找到这一串数字字符最后一个的位置
            if(str.at(i) <= '9' && str.at(i) >= '0')
                num_end = i;
            else
                break;
            i++;
        }
        if(num_end >= num_start && str.at(num_start) >= '0' && str.at(num_start) <= '9'){//如果有数字字符
            long long result = 0;//当int型溢出时，long long 不会溢出。
            long long times = 1;
            int j = num_end;
            while(j >= num_start){//从右往左计算
                result += ((str.at(j) - '0') * times);
                times *= 10;
                j--;
                if(result > INT_MAX)//超出int型所能表示的最大范围
                    return plus_flag ? INT_MAX : INT_MIN;
            }
            return plus_flag ? result : result * (-1);
        }
        else//如果空格字符之后没有数字字符
            return 0;
    }
};