[leetcode]8. String to Integer (atoi)字符串转整数

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

题目

字符串转整数

 

思路

小心各种corner case

 

代码

class Solution {
    public int myAtoi(String str) {
        str = str.trim(); // handle str = "    "的情况, 此时str.length() = 4, 不会走第一个if语句，从而会造成后续指针的outofbound
        if (str == null || str.length() == 0)
        return 0;
        
        char c = str.charAt(0);
        int sign = 1, start = 0, len = str.length();
        long sum = 0;
        // take care of sign 
        if (c == '+') {
            sign = 1;
            start++;
        } else if (c == '-') {
            sign = -1;
            start++;
        }
        
        for (int i = start; i < len; i++) {
            // take care of non numerical digit, like 'w'
            if (!Character.isDigit(str.charAt(i))){
                return (int) sum * sign;
            }
            // convert each char to each digit 
            sum = sum * 10 + str.charAt(i) - '0';
            // Input: "-91283472332"   Output:-2147483648
            if (sign == 1 && sum > Integer.MAX_VALUE){
                return Integer.MAX_VALUE;
            }
            //思考为何不能写成 if(sign == -1 && sum > Integer.MAX_VALUE)
            if (sign == -1 && (-1) * sum < Integer.MIN_VALUE){ 
                return Integer.MIN_VALUE;
            }       
        }
        return (int) sum * sign;
    }
}

 

注意： line11-14 显得很多余，因为通常正整数前不会专门写 ‘+’ 号。 但确实有这样的test case（如下图）， 所以写上这个条件，会更加严谨。