共计 1705 个字符，预计需要花费 5 分钟才能阅读完成。
Implement atoi to convert a string to an integer.
Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cases.
Notes: It is intended for this problem to be specified vaguely (ie, no given input specs). You are responsible to gather all the input requirements up front.
Update (2015-02-10):
The signature of the C++ function had been updated. If you still see your function signature accepts a const char * argument, please click the reload button to reset your code definition.
Requirements for atoi: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. If the correct value is out of the range of representable values, INT_MAX (2147483647) or INT_MIN (-2147483648) is returned.
leetcode加入了太多测试用例。。。。。。。。。。。。。。。。。。。。。。。
class Solution {
public:
int myAtoi(string str) {
if(str.empty()) //空字串
return 0;
//忽略前缀空格
int i = 0;
while (str[i] != '\0' && str[i] == ' ')
++i;
if (str[i] == '\0')
return 0;
int max = 0x7fffffff;
int min = 0x80000000;
int signal = 1;
//处理+、-号
if (str[i] == '+')
{
signal = 1;
++i;
}
else if (str[i] == '-')
{
signal = -1;
++i;
}
//转换整数
long long sum = 0;
while (str[i] != '\0')
{
if (str[i] >= '0' && str[i] <= '9')
sum = sum * 10 + signal * (str[i] - '0');
else
return sum;
if (sum > max || sum < min) //溢出处理
return sum > 0 ? max : min;
++i;
}
return sum;
}
};
