# 实现atoi

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.

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.

int atoi(const char *str)
{
// Start typing your C/C++ solution below
// DO NOT write int main() function
if(str == NULL || *str == '\0')
return 0;
long long res = 0;
while(*str == ' ')
str++;

bool ispositive = true;
if(*str == '-')
{
ispositive = false;
str++;
}
else if(*str == '+')
str++;
while(*str && isdigit(*str))
{
int tmp = *str - '0';
res = res*10 + tmp;
str++;
}
if(! ispositive)
res = -res;
if(res > INT_MAX)
res=INT_MAX;
else if(res < INT_MIN)
res = INT_MIN;
return res;
}

int atoi(const char *str)
{
if(str == NULL || *str == '\0')
return 0;
int num = 0;
int sign = 1;
int i = 0;
int n = strlen(str);
while (str[i] == ' ')
i++;
if (str[i] == '+')
i++;
else if (str[i] == '-')
{
sign = -1;
i++;
}
for (; i < n; i++)
{
if (str[i] < '0' || str[i] > '9')
break;
if (num > INT_MAX / 10 || (num == INT_MAX / 10 &&(str[i] - '0') > INT_MAX % 10))
{
return sign == -1 ? INT_MIN : INT_MAX;
}
num = num * 10 + str[i] - '0';
}
return num * sign;
}

#### atoi()函数自实现

2016-04-29 17:30:22

#### 一道经典面试题，atoi函数的实现

2014-04-13 11:19:16

#### C语言中的atoi函数的实现

2016-04-30 11:00:30

#### atoi的java实现

2014-11-07 10:47:04

#### C语言 atoi函数简单实现

2017-01-02 16:35:11

#### atoi实现的三种方法源码（c++）

2009年09月10日 1KB 下载

#### C++ 实现 atoi

2017-04-01 23:02:15

#### atoi函数简单实现

2016-07-10 12:56:59

#### c函数itoa和atoi实现

2014-01-24 11:18:28

#### C/C++ 实现 atoi 函数

2015-11-16 15:00:34