Java [leetcode 8] 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.

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.

解题思路：

首先调用trim方法除去字符串两边的空白字符。然后从开头读起，如果开头为‘+’，表明该值为正数；如果开头为‘-’，表明该值为负数；如果第一个读到的是‘+’或者‘-’，则从第二个开始读，否则仍然从第一个读起。下面开始一直往后读直到字符串结束。如果在读的过程中读到了除字符’0‘-’9'以外的数字，那么跳出循环，返回计算好的值，否则，不停的计算累加值。

代码如下：

public class Solution {
   public int myAtoi(String str) {
		boolean negative = false;
		int i = 0;
		int result = 0;
		int digit;

		if (str == null || str.length() == 0)
			return 0;
		str = str.trim();
		if (str.length() == 0)
			return 0;
		if (str.charAt(0) == '-' || str.charAt(0) == '+') {
			if (str.charAt(0) == '-') {
				negative = true;
			}
			i++;
		}
		while (i < str.length()) {
			if (str.charAt(i) > '9' || str.charAt(i) < '0')
				break;
			digit = str.charAt(i) - '0';
			if (!negative && result > (Integer.MAX_VALUE - digit) / 10)
				return Integer.MAX_VALUE;
			else if (negative && result > -((Integer.MIN_VALUE + digit) / 10))
				return Integer.MIN_VALUE;
			else {
				result = result * 10 + digit;
				i++;
			}
		}
		return negative ? -result : result;
	}
}