leetcode String to Integer (atoi)

OpenSoucre發表於2014-03-27

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.

此題不是考演算法,主要是考測試用例

(1)數字中含有空格:空格在數字前,空格在數字後面,空格在數字中間

(2)數字中含有+/-:可能連續++,--

(3)數字中含有非數字字元

(4)數字溢位

(5)數字含有前導0

(6)將上面幾個綜合在一起

#include <iostream>
using namespace std;

int atoi1(const char *str) {
    long long sum = 0, sign = 1;
    int i = 0;
    for (i = 0 ; str[i] != '\0'&& str[i] == ' ';  ++ i);
    if (str[i] == '-') { sign = -1; i++;}
    else if(str[i] == '+'){sign = 1; i++;}
    for (; str[i] != '\0';  ++ i) {
        if(str[i]>= '0' && str[i] <= '9') {
            sum = sum*10+(str[i]-'0');
            if (sign*sum > INT_MAX) return INT_MAX;
            else if(sign*sum < INT_MIN) return INT_MIN;
        }else break;
    }
    return sign*sum;
}

int main(){
    char str[]="   010";
    cout<<atoi1(str)<<endl;
}

 

相關文章