LeetCode 8. String to Integer (atoi)

题目来源：https://leetcode.com/problems/string-to-integer-atoi/submissions/

问题描述

8. String to Integer (atoi)

Medium

Implement atoi which converts a string to an integer.

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.

Note:

• Only the space character ' ' is considered as whitespace character.
• Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231,  231 − 1]. If the numerical value is out of the range of representable values, INT_MAX (231 − 1) or INT_MIN (−231) is returned.

Example 1:

Input: "42"

Output: 42

Example 2:

Input: "   -42"

Output: -42

Explanation: The first non-whitespace character is '-', which is the minus sign.

             Then take as many numerical digits as possible, which gets 42.

Example 3:

Input: "4193 with words"

Output: 4193

Explanation: Conversion stops at digit '3' as the next character is not a numerical digit.

Example 4:

Input: "words and 987"

Output: 0

Explanation: The first non-whitespace character is 'w', which is not a numerical

             digit or a +/- sign. Therefore no valid conversion could be performed.

Example 5:

Input: "-91283472332"

Output: -2147483648

Explanation: The number "-91283472332" is out of the range of a 32-bit signed integer.

             Thefore INT_MIN (−231) is returned.

------------------------------------------------------------

题意

给定一个字符串，将其转换成int。为方便陈述，定义“有效字符”为’+’或’-‘或数字。规则如下：

1. 忽略第一个有效字符之前的空格；

2. 如果除空格外的第一个字符为非有效字符或全是空格，则返回0；

3. 忽略第一个非有效字符后的所有字符（包括有效字符）；

4. 如果转换得到的数字超过int范围，则返回int上/下界。

------------------------------------------------------------

思路

题目不难但易错。主要要注意两个边界情况：

1. 全是空格的情况

2. 因为要判断是否超过int范围，所以我的程序里用了long暂时保存结果。但是结果有可能超过long，因此在每一步计算时都要判断是否超int，如果超int，则马上函数返回。

------------------------------------------------------------

代码

class Solution {
    public final long POS_INF = (1 << 31) - 1, NEG_INF = - (1 << 31);
    /**
    pos: if the answer is positive or not
    beg: begin of digits
    end: end of string
    str: String
    */
    public int str2num(boolean pos, int beg, int end, String str)
    {
        long ans = 0, tmp = 0;
        int i;
        char ch;
        for (i=beg; i<end; i++)
        {
            ch = str.charAt(i);
            if (ch > '9' || ch < '0')
            {
                break;
            }
            else
            {
                tmp = (long)(ch - '0');
                ans = ans * 10 + tmp;
                if (ans > POS_INF)
                {
                    if (pos)
                    {
                        return (int)POS_INF;
                    }
                    else
                    {
                        return (int)NEG_INF;
                    }
                }
            }
        }
        if (!pos)
        {
            ans = -ans;
        }
        if (ans < NEG_INF)
        {
            return (int)NEG_INF;
        }
        else if (ans > POS_INF)
        {
            return (int)POS_INF;
        }
        else
        {
            return (int)ans;
        }
    }
    
    public int myAtoi(String str) {
        int i = 0, n = str.length();
        char ch;
        long ans = 0, tmp = 0;
        // deal with corner case and input whitespace
        if (n == 0)
        {
            return 0;
        }
        ch = str.charAt(0);
        while (ch == ' ' && i < n)
        {
            ch = str.charAt(i++);
        }
        if (i == n)
        {
            return 0;
        }
        // check first sign
        if (ch != '-' && ch != '+' && (ch > '9' || ch < '0'))
        {
            return 0;
        }
        else if (ch == '-')
        {
            return str2num(false, Math.max(i, 1), n, str);
        }
        else if (ch == '+')
        {
            return str2num(true, Math.max(i, 1), n, str);
        }
        else
        {
            return str2num(true, Math.max(i-1, 0), n, str);
        }
    }
}