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^31, 2^31 − 1]. If the numerical value is out of the range of representable values, INT_MAX (2^31 − 1) or INT_MIN (−2^31) 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 (−2^31) is returned.
题意很简单,给你一个字符串,按照要求转化成整数,如果不能,则输出0。但是看到难度Medium,想到事情没有那么简单。果然,这道题有很多坑!
-
首先去掉str的左边空格,判断极端情况空串,’+’,’-'或者第一个字符不是数字,直接返回0
-
记录第一个字符是数字还是’+’,’-’,注意遇到有小数点直接跳过就行,我在这点踩了很多次坑,然后把纯数字字符串转化成整形就行,我用的python,直接支持大整数比较方便。
-
最后判断一下是否越界就行,越界则输入最大临界值就行。
Mycode:
class Solution:
def myAtoi(self, str: str) -> int:
str = str.lstrip() #清除空格
if str == '': return 0
if str == '+' or str == '-':
return 0
#如果不是数字
if str[0] != '-' and str[0] != '+' and (not str[0].isdigit()):
return 0
if (str[0]=='+' or str[0]=='-') and (not str[1].isdigit()):
return 0
ans = ''
if str[0] == '+':
for i in range(1, len(str)):
if str[i].isdigit():
ans += str[i]
else:
break
elif str[0] == '-':
for i in range(1, len(str)):
if str[i].isdigit():
ans += str[i]
else:
break
ans = int(ans)*(-1)
else:
for i in range(0, len(str)):
if str[i].isdigit():
ans += str[i]
else:
break
ans = int(ans)
if ans > 2147483647:
ans = 2147483647
elif ans < -2147483648:
ans = -2147483648
return ans
谢谢你的观看!