Leetcode经典面试Java算法8字符串转整数

Implement the myAtoi(string s) function, which converts a string to a 32-bit signed integer (similar to C/C++'s atoi function).

The algorithm for myAtoi(string s) is as follows:

1. Read in and ignore any leading whitespace.
2. Check if the next character (if not already at the end of the string) is '-' or '+'. Read this character in if it is either. This determines if the final result is negative or positive respectively. Assume the result is positive if neither is present.
3. Read in next the characters until the next non-digit charcter or the end of the input is reached. The rest of the string is ignored.
4. Convert these digits into an integer (i.e. "123" -> 123, "0032" -> 32). If no digits were read, then the integer is 0. Change the sign as necessary (from step 2).
5. If the integer is out of the 32-bit signed integer range [-231, 231 - 1], then clamp the integer so that it remains in the range. Specifically, integers less than -231 should be clamped to -231, and integers greater than 231 - 1 should be clamped to 231 - 1.
6. Return the integer as the final result.

Note:

• Only the space character ' ' is considered a whitespace character.
• Do not ignore any characters other than the leading whitespace or the rest of the string after the digits.

Example 1:

Input: s = "42"
Output: 42
Explanation: The underlined characters are what is read in, the caret is the current reader position.
Step 1: "42" (no characters read because there is no leading whitespace)
         ^
Step 2: "42" (no characters read because there is neither a '-' nor '+')
         ^
Step 3: "42" ("42" is read in)
           ^
The parsed integer is 42.
Since 42 is in the range [-231, 231 - 1], the final result is 42.

Example 2:

Input: s = "   -42"
Output: -42
Explanation:
Step 1: "   -42" (leading whitespace is read and ignored)
            ^
Step 2: "   -42" ('-' is read, so the result should be negative)
             ^
Step 3: "   -42" ("42" is read in)
               ^
The parsed integer is -42.
Since -42 is in the range [-231, 231 - 1], the final result is -42.

Example 3:

Input: s = "4193 with words"
Output: 4193
Explanation:
Step 1: "4193 with words" (no characters read because there is no leading whitespace)
         ^
Step 2: "4193 with words" (no characters read because there is neither a '-' nor '+')
         ^
Step 3: "4193 with words" ("4193" is read in; reading stops because the next character is a non-digit)
             ^
The parsed integer is 4193.
Since 4193 is in the range [-231, 231 - 1], the final result is 4193.

Example 4:

Input: s = "words and 987"
Output: 0
Explanation:
Step 1: "words and 987" (no characters read because there is no leading whitespace)
         ^
Step 2: "words and 987" (no characters read because there is neither a '-' nor '+')
         ^
Step 3: "words and 987" (reading stops immediately because there is a non-digit 'w')
         ^
The parsed integer is 0 because no digits were read.
Since 0 is in the range [-231, 231 - 1], the final result is 0.

Example 5:

Input: s = "-91283472332"
Output: -2147483648
Explanation:
Step 1: "-91283472332" (no characters read because there is no leading whitespace)
         ^
Step 2: "-91283472332" ('-' is read, so the result should be negative)
          ^
Step 3: "-91283472332" ("91283472332" is read in)
                     ^
The parsed integer is -91283472332.
Since -91283472332 is less than the lower bound of the range [-231, 231 - 1], the final result is clamped to -231 = -2147483648.

Constraints:

• 0 <= s.length <= 200
• s consists of English letters (lower-case and upper-case), digits (0-9), ' ', '+', '-', and '.'.

解题思路：

1. 忽略所有以空格开始的字符.
2. 判断字符 '-' or '+'.
3. 直到非数字字符出现, 停止分析.
4. (i.e. "123" -> 123, "0032" -> 32). .
5. 如果结果查出数字空间, 则选择上下线的数字 [-231, 231 - 1]

这道题虽然难度中等, 但是没有什么复杂度, 就是各类判断条件比较多, 需要理清楚

这类转int型因为考虑的overflow的问题, 所以倾向用long来定义变量, 最终转为int, 否则还要加%和/的判断条件.

class Solution {
    public int myAtoi(String s) {
        
        if (s.length() == 0)
            return 0;
        
        s = s.trim();
        boolean flag = false;
        
        if (s.length() > 1 && s.charAt(0) == '-' && (s.charAt(1) >= '0' && s.charAt(1) <= '9')) {
            flag = true;
            s = s.substring(1);
        }
        
        if (s.length() > 1 && s.charAt(0) == '+' && (s.charAt(1) >= '0' && s.charAt(1) <= '9')) {
            s = s.substring(1);
        }
        
        long ret = 0;
        for (char c : s.toCharArray()) {
            if ((c >= '0' && c<= '9')) {
                ret = ret*10 + ((int)c - (int)'0');
                if (flag) {
                    if (ret* -1 < Integer.MIN_VALUE) {
                        return Integer.MIN_VALUE;
                    }
                } else if (ret > Integer.MAX_VALUE) {
                    return Integer.MAX_VALUE;
                }
            } else {
                break;
            }
        }
        
        if (flag) {
            ret = ret * -1;
        }
        
        return (int)ret;
    }
}