[LeetCode]008-String to Integer

最新推荐文章于 2020-03-08 19:19:55 发布

txHe

最新推荐文章于 2020-03-08 19:19:55 发布

阅读量227

点赞数

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

本文链接：https://blog.csdn.net/htx931005/article/details/50193183

版权

LeetCode 专栏收录该内容

50 篇文章 0 订阅

订阅专栏

题目:
String to Integer

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.

Solution:
解法不难，就是要注意的细节很多。提交了n次，才Accepted.比较核心点的，就是判断整数越界的那个地方，需要注意。

 int myAtoi(string str)
    {
        int n = str.size();
        int i =0;
        int integral_number =0;
        int positive_number = 0;
        int result = 0;

        bool ispositive = true;
        if(n == 0)
        {
            return 0;
        }
        while(i<n)
        {
            if(str[i] == ' ')
            {
                i++;
                if(i == n)
                    break;
                if(integral_number != 0 || positive_number != 0)
                    break;
                continue;
            }
            else if(str[i] == '+' || str[i] == '-')
            {
                if(str[i] == '+')
                    ispositive =true;
                else
                    ispositive =false;
                positive_number ++;
                if(positive_number >1)
                {
                    return 0;
                }
            }
            else if(str[i] < '0' || str[i] >'9')
            {
                break;
            }

            if('0'<=str[i] && str[i] <='9')
            {
                integral_number++;
                if(INT_MAX / 10  <= result && ispositive)
                {
                    if(result == INT_MAX /10)
                    {
                        int last_number = str[i] - '0';
                        if(last_number >= 8)
                            return INT_MAX;
                    }
                    else
                        return INT_MAX;
                }
                else if((-(INT_MIN/10)) <= result && !ispositive)
                {
                    if(result == -(INT_MIN/10))
                    {
                        int last_number = str[i] - '0';
                        if(last_number > 8)
                            return INT_MIN;
                    }
                    else
                        return INT_MIN;
                }
                result  = result*10 + (str[i] - '0');
            }
            i++;
        }
        if(!ispositive)
            result = - result;

        return result;
    }