8. String to Integer (atoi)

8. String to Integer


Implement atoi which converts a string to an integer.

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.

Note:

Only the space character ’ ’ is considered as whitespace character.
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. If the numerical value is out of the range of representable values, INT_MAX (231 − 1) or INT_MIN (−231) is returned.
Example 1:

Input: "42"
Output: 42

Example 2:

Input: "   -42"
Output: -42
Explanation: The first non-whitespace character is '-', which is the minus sign.
             Then take as many numerical digits as possible, which gets 42.

Example 3:

Input: "4193 with words"
Output: 4193
Explanation: Conversion stops at digit '3' as the next character is not a numerical digit.

Example 4:

Input: "words and 987"
Output: 0
Explanation: The first non-whitespace character is 'w', which is not a numerical 
             digit or a +/- sign. Therefore no valid conversion could be performed.

Example 5:

Input: "-91283472332"
Output: -2147483648
Explanation: The number "-91283472332" is out of the range of a 32-bit signed integer.
             Thefore INT_MIN (−231) is returned.

方法1:

思路:

有很多test case需要特别处理:

  1. 要remove leading white space
  2. 有没有第一个non white space?是否为数字或者“+/-”?可以继续:直接返回0
  3. 如果是“+/-”,读入一个sign
  4. 接下来如果是数字的话开始连续读入,直到非数字
  5. 每一步要一次次进位上去,这样可以避免在全部读入之后发现已经overflow
  6. 在进位的过程中用reverse integer的方法预警overflow,这里有一个更多的细节就是我们要卡死overflow的瞬间。怎么做到?[-2147483648,2147483647],因为已知这两个值的末位不是7就是8,那么我们在已知num > INT_MAX / 10 或者num < INT_MIN / 10 的情况下,只需要判断末位是不是 > 7。注意这里是>7, 因为我们手中是一个正数int,只能handle末位是7或以下的情况。handle的意思是,加上下一个数字,正int也能hold住。但是如果大于7,那就没有必要再往上加了,只需进一步判断符号,如果是负,返回INT_MIN, 是正返回INT_MAX。
  7. 拦截住了overflow的这些情况,就可以直接加上最后数字和sign并返回了

易错点

除了全都很易错以外,下面这些特别易错:

  1. 注意拦截overflow时的情况,我们要分为三种情况:1. digit > INT_MAX / 10 不管末位是什么都overflow,2. digit == INT_MAX / 10, 末位 > 7 会overflow,3,其他情况不会overflow。错法见comment掉的条件。
class Solution {
public:
    int myAtoi(string str) {
        int n = str.size();
        int i = 0;
        int sign = 1;
        while (i < n && str[i] == ' '){
            i++;
        }
        // 拦截空字符串/全while space字符串
        if (i == n) return false;
        if (str[i] == '+' || str[i] == '-'){
            sign = (str[i] == '+') ? 1 : -1;
            i++;
        }
        // 拦截所有不为数字的情况
        if (str[i] < '0' || str[i] > '9') return 0;
        // 确认存在效数字,开始计算
        int digit = 0;
        
        while (i < n && str[i] >= '0' && str[i] <= '9'){
            // 提前拦截所有overflow
            if (digit > INT_MAX / 10 || digit == INT_MAX / 10 && str[i] - '0' > 7){
            // if (digit >= INT_MAX / 10 && str[i] - '0' > 7){
                return sign > 0 ? INT_MAX : INT_MIN;
            }
            digit = digit * 10 + (str[i] - '0');
            i++;
        }
        return sign * digit;
    }
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值