String to Integer (atoi)

来源:互联网 发布:使用sql语句创建数据库 编辑:程序博客网 时间:2024/06/06 00:11

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.

不看提示,要保证各个场景比遗漏,比较困难。

class Solution {public:    int myAtoi(string str) {        long long r = 0;        size_t i = 0;        bool  negative = false;        // 跳过空格        while (' ' == str[i]) {            i++;        }        // 判断符号位        if (str[i] == '-') {            negative = true;            i++;        }        else if (str[i] == '+') {            negative = false;            i++;        }        // 跳过0        while ('0' == str[i]) {            i++;        }                for (; i < str.size(); i++){            if (str[i] >= '0' && str[i] <= '9'){                r = r * 10 + str[i] - '0';                if (!negative && r > numeric_limits<int>::max())                    return numeric_limits<int>::max();                if (negative && -r < numeric_limits<int>::min())                    return numeric_limits<int>::min();            }            else {                break;            }        }        return negative ? -r : r;    }};


0 0
原创粉丝点击