LeetCode 8. String to Integer (atoi)

Description

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: [-2³¹, 2³¹ − 1]. If the numerical value is out of the range of representable values, INT_MAX (2³¹ − 1) or INT_MIN (−2³¹) is returned.

Example

Code

• java

class Solution {
    public int myAtoi(String str) {
        boolean neg = false, pos = false, prespace = true;
        long result = 0;
        long minValue = Integer.MAX_VALUE, maxValue = Integer.MAX_VALUE;
        minValue += 1;
        for(int i = 0; i < str.length(); i++) {
            char ch = str.charAt(i);
            if(prespace && ch == ' ') {
                continue;
            } else if(ch >= '0' && ch <= '9') {
                result = result * 10 + ch - '0';
                if(neg && result >= minValue) {
                    return Integer.MIN_VALUE;
                } else if(!neg && result >= maxValue) {
                    return Integer.MAX_VALUE;
                }
            } else if(!neg && !pos && (ch == '+' || ch == '-')) {
                if(i - 1 >= 0 && str.charAt(i-1) != ' ') break;
                if(ch == '-') neg = true;
                else pos = true;
            } else {
                break;
            }
            prespace = false;
        }
        if(neg) result = -result;
        return (int)result;
    }
}

• Others’ solution

int atoi(const char *str) {
    int sign = 1, base = 0, i = 0;
    while (str[i] == ' ') { i++; }
    if (str[i] == '-' || str[i] == '+') {
        sign = 1 - 2 * (str[i++] == '-'); 
    }
    while (str[i] >= '0' && str[i] <= '9') {
        if (base >  INT_MAX / 10 || (base == INT_MAX / 10 && str[i] - '0' > 7)) {
            if (sign == 1) return INT_MAX;
            else return INT_MIN;
        }
        base  = 10 * base + (str[i++] - '0');
    }
    return base * sign;
}

Conclusion

• 非空格非数字且符号位不合理的地方直接break
• 大佬的边界处理特别棒，学习了（虽然上一题就应该记住hhh

if (base >  INT_MAX / 10 || (base == INT_MAX / 10 && str[i] - '0' > 7)) {
     if (sign == 1) return INT_MAX;
     else return INT_MIN;
}