String to Integer (atoi)

来源:互联网 发布:java sftp 创建目录 编辑:程序博客网 时间:2024/06/07 01:07

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.

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.

注意判断溢出:32位系统long和int一样都是四个四节,64位中long是8个字节;所以用long long比较保险,至少8个字节。

class Solution {public:    int atoi(const char *str) {        if(str == NULL ) {            return 0;        }                while(*str == ' '){            ++str;        }                bool sign = true;        if(*str == '-') {            sign = false;            ++str;        }        else if (*str == '+'){            ++str;        }                long long result = 0;        while(*str != '\0') {            if (*str >='0' && *str <= '9'){                result = result * 10 + (*str - '0');                if((!sign) && (-result < INT_MIN)) {                    return INT_MIN;                }                else if (sign && (result > INT_MAX)) {                    return INT_MAX;                }                ++str;            }            else {                break;            }        }               return sign ? result : -result;    }};


0 0
原创粉丝点击