LeetCode 8. String to Integer (atoi)

最新推荐文章于 2020-04-04 20:44:24 发布

_May

最新推荐文章于 2020-04-04 20:44:24 发布

阅读量413

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/Cyril_JZ/article/details/77096986

版权

LeetCode 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

Description:

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.

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.

Submission Details
1047 / 1047 test cases passed.
Status: Accepted
Runtime: 16 ms

class Solution {
public:
    int myAtoi(string str) {
        if (str.length() == 0) return 0;
        int p = 0, q; 
        long long res = 0; 
        int flag = 0;
        while (isspace(str[p])) { 
            p++;
        }
        if (str[p] == '+' || str[p] == '-') { 
            if (str[p] == '-') {
                flag = 1;   
            }
            p++;
        }
        q = p;
        while (isdigit(str[q])) { 
            q++;
        }
        str = str.substr(p, q - p);
        if (str.length() == 0) return 0;
        if (str.length() > 10) {
            if (flag) return -2147483648;
            else return 2147483647;
        }
        res = stoll(str);
        if (!flag) {
            if (res > 2147483647) {
                return 2147483647;
            }
        } else {
            res = -res;
            if (res < -2147483648) {
                return -2147483648;
            }
        }
        return res;
    }
};