LeetCode:8. String to Integer (atoi)

Posted on In Disqus:

题目

https://leetcode.com/problems/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.

需要注意的

  • 去除之前的空格
  • +-用else
  • 用long long,long在32位下最大值和int一样大
  • 中间出现了非数字则停止并返回前面的数字

代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
class Solution {
public:
    int myAtoi(string str)
    {
        int index = 0;
        while (str[index] == ' ') ++index;
        bool flag = true;
        if (str[index] == '+' || str[index] == '-')
        {
            '+' == str[index] ? flag = true : flag = false;
            ++index;
        }
        int size = str.size();
        long long sum = 0;
        while (index < size)
        {
            if (str[index] >= '0' && str[index] <= '9')
            {
                sum = sum * 10 + str[index] - '0';
                if (flag && sum > INT_MAX) return INT_MAX;
                else if (!flag && sum * (-1) < INT_MIN) return INT_MIN;
            }
            else
            {
                break;
            }
            ++index;
        }
        return sum * (flag ? 1 : -1);
    }
};