题目:
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.
思路:
确实是一道很无聊的题,按部就班转化就好了,有很多特殊情况需要考虑,不多说了,有很多测试用例。直接上代码,不难理解。
代码:
int myAtoi(char * str){
double res = 0;
int i;
bool flag =false; //正负数
bool positive =false; //是否有+号
bool begin =false; //是否有减号
bool number =false; //是否已经开始转化
//bool isdig =false;
int temp;
for(i=0;str[i]!='\0' ;i++)
{
if(str[i] ==' ' && begin ==false )
{
continue;
}
else if(str[i] ==' ')
{
break;
}
if(str[i] == '+'&& number ==false && begin ==false)
{
begin=true;
positive=true;
continue;
}
else if(str[i] == '+')
{
break;
}
if(str[i] == '-' && number ==false && begin ==false)
{
begin=true;
flag =true;
continue;
}
else if(str[i] == '-')
{
break;
}
if(str[i] >'9' || str[i] < '0' )
{
break;
}
temp =str[i]-'0';
res = temp+res*10;
begin=true;
number =true;
}
if(flag ==true && positive==true)
{
return 0;
}
int value =res;
if( value !=res)
{
if(flag ==true)
{
return -2147483648;
}
else
{
return 2147483647;
}
}
if(flag ==true)
{
res =-res;
}
return res;
}
执行效率:
效率还行,还是很想吐槽着道题,就当做练习吧,要仔细考虑很多种特殊情况。