1 题目要求:
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.
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.
2 解决方法:
条件有一些多,整理一下
1.字符串前部可有任意长连续空格
2.加号或减号表示正负
3.任意长数字
4.额外的字符串无视
5.超过32位取边界极值
class Solution {
public:
int myAtoi(string str) {
int temp, ret = 0, sign = 1, i = str.find_first_not_of(' ');
if (str[i] == '+' || str[i] == '-') sign = 2 * (str[i++] == '+') - 1;
while (str[i] <= '9'&&str[i] >= '0') {
temp = ret;
ret = sign * (str[i++] - '0') + ret * 10;
if (ret / 10 != temp) ret = sign > 0 ? INT_MAX : INT_MIN;
}
return ret;
}
};
时间复杂度O(log(x))
空间复杂度O(1)
3 总结
这道题叙述很模糊,试了半天。复习了string的find_first_not_of方法,复习了加法乘法溢出判断。