8. String to Integer (atoi)

目录

 

题目

知识点

解法一：

解法二：

---

题目

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.如何判断是否超出整数范围：一种方式是每次*10之前，都先比较下是否大于man_int/10，以及将要加的数是否超过；另一种方式max(-2**31, min(sign * ret,2**31-1))

2.为何32位机器表示的最大整数是2的31次方-1，而最小整数是负2的31次方。整数在内存中是以补码的形式存储的，第一位是符号为，0表示正数，1表示负数。32个0表示0，1和31个0表示负2的31次方，因此负数的范围会比正数的多1，实际差在0上了。

3.判断ls[i]为数字后，评论里说用ord(ls[i]) - ord('0')得到对应的整数值，而不是int()强制转换，是因为用Int强制转换的时间复杂度高。

3.isdigit判断接下来的字母是否数字，比我的方法简洁

解法一：

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;
}

解法二：

我自己的解法，有点啰嗦

class Solution:

    def myAtoi(self, s: str) -> int:
        maxInt=2**31-1
        minInt=2**31
        s=s.lstrip()
        if len(s)<1:
            return 0

        n = 0
        ifNegative=False
        c=s[0]
        if(c=='-'):
            ifNegative=True
        elif(c =='+'):
            ifNegative=False
        elif(ord(c)>=48 and ord(c)<=57):
            n=ord(c)-48
        else:
            return 0
        i=1
        while(i<len(s)):
            tmp=ord(s[i])-48
            if(tmp<0 or tmp>9):
                break
            if(ifNegative):
                if (n <= minInt // 10 and tmp <= minInt - n*10):
                    n = n * 10 + tmp
                else:
                    n = minInt
                    break
            else:
                if(n<=maxInt//10 and tmp<=(maxInt-n*10)):
                    n=n*10+tmp
                else:
                    n=maxInt
                    break
            i+=1
        if(ifNegative):
            return 0-n
        else:
            return n

解法三

同样是python，比我的精简很多

class Solution(object):
    def myAtoi(self, s):
        """
        :type str: str
        :rtype: int
        """
        ls = list(s.strip())
        if len(ls) == 0 : return 0
        
        sign = -1 if ls[0] == '-' else 1
        if ls[0] in ['-','+'] : del ls[0]
        ret, i = 0, 0
        while i < len(ls) and ls[i].isdigit() :
            ret = ret*10 + ord(ls[i]) - ord('0')
            i += 1
        return max(-2**31, min(sign * ret,2**31-1))