leetcode:String to Integer (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.

accepted with C++:

class Solution {
public:
    int atoi(const char *str) {
        if (str == NULL)
            return 0;
        int sum = 0;
        bool is_negative = false;
        int state = 0;
        // beg and end is dight char range
        int beg = 0, end = 0;
        int i = 0;
        for(; str[i] != '\0'; i++) {
            if (state == 0) {
                // when state is 0
                // we skip white space
                if (str[i] == '-') {
                    is_negative = true;
                    beg = i;
                    state = 1;
                } else if (str[i] == '+') {
                    is_negative = false;
                    beg = i;
                    state = 1;
                } else if (str[i] == ' ') {
                    continue;
                } else if (str[i] > '0' && str[i] <= '9') {
                    beg = i;
                    char ch = str[i];
                    int cur = ch - '0';
                    sum = cur + sum * 10;
                    state = 2;
                } else if (str[i] == '0') {
                    beg = i;
                    state = 1;
                } else {
                    return 0;
                }
            } else if (state == 1) {
                // filter zero before digit
                // we find first dight char greater than 0
                if (str[i] == '0') {
                    continue;
                } else if (str[i] > '0' && str[i] <= '9') {
                    beg = i;
                    char ch = str[i];
                    int cur = ch - '0';
                    sum = cur + sum * 10;
                    state = 2;
                } else {
                    return 0;
                }
            }
            else {
                // when state is 2
                // we are in digit range, we need to check the end of str
                if (str[i] >= '0' && str[i] <= '9') {
                    char ch = str[i];
                    int cur = ch - '0';
                    sum = cur + sum * 10;
                } else {
                    break;
                }
            }
        }
        end = i;

        if (is_negative) {
            // check underflow
            if (underflow(str, beg, end))
                return -2147483648;
            else
                return -sum;
        } else {
            // check overflow
            if (overflow(str, beg, end))
                return 2147483647;
            else
                return sum;
        }
    }

    bool overflow(const char *str, int beg, int end) {
        const char *max_int = "2147483647";
        const int length = 10;
        if ((end - beg) > length) {
            return true;
        } else if ((end - beg) < length) {
            return false;
        } else {
            // same length
            // compare part of str to max_int
            for (int i = 0; i < length; i++) {
                if (str[beg + i] > max_int[i])
                    return true;
                if ((str[beg + i] < max_int[i]))
                    return false;
            }
            return false;
        }
    }

    bool underflow(const char *str, int beg, int end) {
        const char *max_int = "2147483648";
        const int length = 10;
        if ((end - beg) > length) {
            return true;
        } else if ((end - beg) < length) {
            return false;
        } else {
            // same length
            // compare part of str to max_int
            for (int i = 0; i < length; i++) {
                if (str[beg + i] > max_int[i])
                    return true;
                if ((str[beg + i] < max_int[i]))
                    return false;
            }
            return false;
        }
    }
};

accepted with java：

  <pre name="code" class="java"> public class Solution {
        public int atoi(String str) {
            str=str.trim();
            long result = 0;
            int i = 0;
            boolean flag = false;
            if(str.equals(""))
                return 0;
            if(str.charAt(0) == '-'){
                flag = true;
                i++;
            }
            if(str.charAt(0) == '+')
                i++;
            for(; i < str.length(); i++){
                if(str.charAt(i) > '9' || str.charAt(i) < '0')
                    break;
                int a = (int)(str.charAt(i) - '0');
                result = result*10 + a;
                if(result > 0x7fffffff){
                    if(flag)
                        return 0x7fffffff * -1 - 1;
                    else
                        return 0x7fffffff;
                }
            }
            if(flag)
                return (int)result * -1;
            else
                return (int)result;
        }
    }