LeetCode_String to Integer (atoi)

Implement atoi to convert a string to an integer.

int atoi (const char * str);
Convert string to integer
Parses the C-string str interpreting its content as an integral number, which is returned as a value of type int.

The function first discards as many whitespace characters (as in isspace) 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 base- 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 and zero is returned.

class Solution {
public:
    int atoi(const char *str) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
         int len = strlen(str) ;
         int i =;
         long long result = ;
         int flag = , b= ;
         int numjia = ;
         int numjian = ;

         while(i<len && str[i] == ' ') i++;

         for(; i< len ; i++)
         {
            switch(str[i])
            {
                case '+': numjia++;break;
                case '-': numjian++; flag =-;break;
                case '':
                case '':
                case '':
                case '':
                case '':
                case '':
                case '':
                case '':
                case '':
                case '': result+=str[i] - '';result*=;break;
                default: b = ;break;
            }
            if(b==) break;
            if(numjia> ||numjian>)
                return ;
         }

          result = result/;
          result *= flag;

          if(result > INT_MAX) return INT_MAX;
          if(result < INT_MIN) return INT_MIN;
          return result;
    }
};

重写后：

class Solution {
public:
    int atoi(const char *str) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function

        if(str == NULL ) return ;

        int len = strlen(str);
        long long res = ;
        int cur = , flag = ;

        while(cur<len && str[cur] == ' ') ++cur;

        if( str[cur] == '-' || str[cur] == '+'){
            if(str[cur] == '-')
              flag = -;
            cur++;
        }

        while(cur < len){
            int c = str[cur] - '';
            if(c< || c > )
                break;
            res = c + res*;
            ++cur;
        }
        res *= flag ;

        if(res > INT_MAX)
            return INT_MAX;
        if(res < INT_MIN)
          return INT_MIN;

        return res;
    }
};