(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.

解题思路：

这道题主要就是要注意在转换成整数的过程中有这几方面的问题：

（1）去掉前面多余的空格

（2）在数之前出现多余的符号时，返回0； “   +-123”，返回0

（3）在数的中间出现其他符号时，返回前面的数值。  “   12s123”，返回12

（4）当转换的数超过INT_MAX (2147483647) 或者INT_MIN (-2147483648)时，当数为正数，返回INT_MAX，当数为负数，返回INT_MIN。

[java] view plain copy

print ?

1. public class Solution {  
2.     public int myAtoi(String str) {  
3.         int num = 0;  
4.         int i = 0;  
5.         int length = str.length();  
6.         int isPositive = 1;  
7.         //去掉多余的0  
8.         while(i<length && str.charAt(i) == ' ')  
9.             i++;  
10.         //数为正数  
11.         if(i<length && str.charAt(i) == '+')  
12.             i++;  
13.         //数为负数  
14.         else if(i<length && str.charAt(i) == '-')  
15.         {  
16.             isPositive = -1;  
17.             i++;  
18.         }  
19.         while(i<length)  
20.         {  
21.             int index = str.charAt(i)-'0';  
22.             //出现其他符号  
23.             if(index <0 || index >9)  
24.                 break;  
25.             int num1 = num*10 + index;  
26.             //判断是否溢出  
27.             if(num1*isPositive/10 != num*isPositive)  
28.             {  
29.                 //正数，返回INT_MAX  
30.                 if(isPositive > 0)  
31.                     num = 2147483647;  
32.                 //负数，返回INT_MIN  
33.                 else  
34.                     num = -2147483648;  
35.                 return num;  
36.             }  
37.             num = num1;  
38.             i++;  
39.         }  
40.         return num*isPositive;  
41.     }  
42. }  

public class Solution {
    public int myAtoi(String str) {
        int num = 0;
		int i = 0;
		int length = str.length();
		int isPositive = 1;
		//去掉多余的0
		while(i<length && str.charAt(i) == ' ')
			i++;
		//数为正数
		if(i<length && str.charAt(i) == '+')
			i++;
		//数为负数
		else if(i<length && str.charAt(i) == '-')
		{
			isPositive = -1;
			i++;
		}
		while(i<length)
		{
			int index = str.charAt(i)-'0';
			//出现其他符号
			if(index <0 || index >9)
				break;
			int num1 = num*10 + index;
			//判断是否溢出
			if(num1*isPositive/10 != num*isPositive)
			{
				//正数，返回INT_MAX
				if(isPositive > 0)
					num = 2147483647;
				//负数，返回INT_MIN
				else
					num = -2147483648;
				return num;
			}
			num = num1;
			i++;
		}
		return num*isPositive;
    }
}