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.
spoilers alert... click to show 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.
class Solution {
public:
int myAtoi(string str) {
if(str.empty())
return 0;
bool flag=false;
long result = 0;//保存转换结果
int i = 0;
i=str.find_first_not_of(' ');//从字符串找出非空格字符
cout<<"i= "<<i<<endl;
//判断str中第一个非空格字符是否为正负号,如果是,从str下一个字符开始进行转换
if(str[i]=='-'){
flag=true;
++i;
if(str.length()==1)
return 0;
}//if
else if(str[i]=='+'){
++i;
if(str.length()==1)
return 0;
}
//字符串转变为整数
for(i;i!=str.length();++i){
if(str[i]>'9'||str[i]<'0')//遇到非数字字符,跳出循环
break;
result=result*10+str[i] - '0';
if(result>=INT_MAX)//由于转换过程中得到的结果不考虑正负号,当result在转换过程中超出最大值MAX_INT,跳出循环
break;
}//for
if(flag==true)//判断正负号
result = -1*result;
//返回结果
if(result>=INT_MAX)
return INT_MAX;
else if(result<=INT_MIN)
return INT_MIN;
return result;
}
};