[LeetCode 题解]: String to Interger (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.

spoilers alert... click to show requirements for atoi.

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.

提示： 使用string的特性来判断是否越界。 strcmp

1.去掉字符串之前多余的空格

2. 判断正负号

3. 记录数字字符串。

4. 判断是否越界。

    利用好：strcmp

 class Solution {
 public:
     int atoi(const char *str) {
         const char* Max = "";
         const char* Min = "";
         char b[];
         int number=;
         int below=,i=,j=;
         while(str[i]==' ')i++;
         if(i==strlen(str)) return ;

         if(str[i]=='+'||str[i]=='-')
         {
             if(str[i]=='-') below=;
             i++;
         }

         for(;i<strlen(str);i++)
         {
             if(str[i]>='' && str[i]<='')
                 b[j++]=str[i];
             else
                 break;
         }
         b[j]='\0';
         int lb = strlen(b);
         if(lb>)
         {
             if(below) return INT_MIN;
             else return INT_MAX;
         }
         else if(lb==)
         {
             if(below)
             {
                 if(strcmp(b,Min)>=) return INT_MIN;
                 else
                 {
                     for(j=;j<lb;j++)
                         number= number* + b[j]-'';
                 }
             }
             else
             {
                 if(strcmp(b,Max)>=) return INT_MAX;
                 else
                 {
                      for(j=;j<lb;j++)
                         number= number* + b[j]-'';
                 }
             }
         }
         else
         {
             for(j=;j<lb;j++)
                 number= number* + b[j]-'';
         }
         return below>?-number:number;
     }

 };

分支结构有点多，需要仔细分析分析。

转载请注明出处： http://www.cnblogs.com/double-win/谢谢