[LeetCode]String to Integer (atoi)

最新推荐文章于 2024-05-29 22:54:07 发布

UndefinedZ01

最新推荐文章于 2024-05-29 22:54:07 发布

阅读量5.7k

点赞数 1

分类专栏： LeetCode 文章标签： String to Integer at LeetCode C++

本文链接：https://blog.csdn.net/zhouworld16/article/details/16082765

版权

LeetCode 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

题目要求：

mplement 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.

照着要求写代码，可以总结如下：

1. 字串为空或者全是空格，返回0；

2. 字串的前缀空格需要忽略掉；

3. 忽略掉前缀空格后，遇到的第一个字符，如果是‘+’或‘－’号，继续往后读；如果是数字，则开始处理数字；如果不是前面的2种，返回0；

4. 处理数字的过程中，如果之后的字符非数字，就停止转换，返回当前值；

5. 在上述处理过程中，如果转换出的值超出了int型的范围，就返回int的最大值或最小值。

清楚了要求，就可以写出AC的代码了。

我的代码如下，欢迎各位大牛指导交流~

AC，Runtime: 32 ms

//LeetCode_String to Integer (atoi)
//Written by zhou
//2013.11.13
class Solution {
public:
    int atoi(const char *str) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        
        if (str == NULL)   //空字串
           return 0;
        
        //忽略前缀空格
        int i = 0;
        while (str[i] != '\0' && str[i] == ' ')
          ++i;
          
        if (str[i] == '\0')
          return 0;
        
        int max = 0x7fffffff;
        int min = 0x80000000;
        int signal = 1;
        
        //处理+、-号
        if (str[i] == '+')
        {
            signal = 1;
            ++i;
        }
        else if (str[i] == '-')
        {
            signal = -1;
            ++i;
        }
        
        //转换整数
        long long sum = 0;
        while (str[i] != '\0')
        {
            if (str[i] >= '0' && str[i] <= '9')
                 sum = sum * 10 + signal * (str[i] - '0');
            else 
                return sum;
            if (sum > max || sum < min)   //溢出处理
                return sum > 0 ? max : min;
            ++i;
        }
        return sum;
    }
};