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

思路：

　　该题目是说将string类型的字符串转换成整型数据，类似于C++库里的atoi函数，解决该题目的关键在于两个方面：

　　（1）字符串格式的合法判断

　　（2）转换结果的溢出判断

public class Solution {
    public int myAtoi(String str) {
        str=str.trim();
        char[] arr=str.toCharArray();
        if(arr.length==0){
            return 0;
        }
        
        int i=0;
        boolean symbol=true;
        if(arr[i]=='-'){
            symbol=false;
            i++;
        }else if(arr[i]=='+'){
            i++;
        }
    
        
        long MAX_VALUE=Integer.MAX_VALUE;
        long MIN_VALUE=Integer.MIN_VALUE;
        long num=0;
        for(int j=i;j<arr.length;j++){
            if(arr[j]>='0'&&arr[j]<='9'){
                num=num*10+arr[j]-'0';
            }else{
                break;
            }
            
            if(!symbol&&(0-num<MIN_VALUE)){
                return Integer.MIN_VALUE;
            }else if(symbol&&(num>MAX_VALUE)){
                return Integer.MAX_VALUE;
            }
        }
        
        return symbol?new Long(num).intValue():new Long(0-num).intValue();
    }
}