leetcode-腾讯精选50题-05

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: [−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.

正常版本

• 按照题目提示一步一步判定
• 注意要判断字符串为空的情况，不然会超出范围

class Solution:
    def myAtoi(self, str: str) -> int:
        str = str.lstrip()
        res = 0
        if len(str) == 0:
            return 0
        if str[0] == '-' or str[0] == '+':
            i = 2
        else:
            i = 1
        while i <= len(str):
            try:
                res = int(str[:i])
                i += 1
            except:
                break
        if res < -2147483648:
                    return -2147483648
        elif res > 2147483647:
            return 2147483647
        else:
            return res
        

正则版本

作者QQqun902025048提供的思路，正则表达式原来这么方便

^：匹配字符串开头
[\+\-]：代表一个+字符或-字符
?：前面一个字符可有可无
\d：一个数字
+：前面一个字符的一个或多个
\D：一个非数字字符
*：前面一个字符的0个或多个

class Solution:
    def myAtoi(self, str: str) -> int:
         return max(min(int(*re.findall('^[\+\-]?\d+', s.lstrip()), 2>>31 - 1), -2>>31)