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

public class Solution {

	public int myAtoi(String str) {
		if(str.equals("")){
			return 0;
		}
        char[] chs = str.toCharArray();
        int len = chs.length;
        double sum = 0;
        /*for(int i = 0;i<len;i++){
        	if(chs[i]==' '){
        		chs[i]='0';
        	}
        }*/
        int j = 0;
        int a = -1;
        while(chs[j]==' '){
        	a = j;
        	j++;
        }
        int b = a+1;
        //System.out.println(b);
        for(int r = b+1;r<len;r++){
        	if(chs[r]<'0' || chs[r]>'9'){
        		len = r;
        		break;
        	}
        }
        //System.out.println(len);
        if(chs[b]=='+'){
        	for(int i = b+1;i<len;i++){
        		if(chs[i]>='0' && chs[i]<='9'){
        			sum+=(chs[i]-'0')*Math.pow(10, len-i-1);
        		}if(chs[i]==' '){
        			return (int) ((int) sum/Math.pow(10, len-i));
        		}else 
        			
        			if(chs[i]<'0' || chs[i]>'9'){
        			return (int) ((int) sum/Math.pow(10, len-i));
        		}
            }
        }else if(chs[b]=='-'){
        	for(int i = b+1;i<len;i++){
        		if(chs[i]>='0' && chs[i]<='9'){
        			sum+=(chs[i]-'0')*Math.pow(10, len-i-1);
        		}if(chs[i]==' '){
        			return (int) ((int) sum/Math.pow(10, len-i));
        		}else if(chs[i]<'0' || chs[i]>'9'){
        			return (int) ((int) (-1)*((int) sum/Math.pow(10, len-i)));
        		}
            }
        	sum = (-1)*sum;
        }else{
        	for(int i = b;i<len;i++){
        		if(chs[i]>='0' && chs[i]<='9'){
        			sum+=(chs[i]-'0')*Math.pow(10, len-i-1);
        		}if(chs[i]==' '){
        			return (int) ((int) sum/Math.pow(10, len-i));
        		}else if(chs[i]<'0' || chs[i]>'9'){
        			return (int) ((int) sum/Math.pow(10, len-i));
        		}
            }
        }
        if(sum>Integer.MAX_VALUE ){
        	return Integer.MAX_VALUE;
        }
        if(sum<Integer.MIN_VALUE){
        	return Integer.MIN_VALUE;
        }
        return (int)sum;
    }
	public static void main(String[] args) {
		System.out.println(new Solution().myAtoi("   -1123u3761867"));

	}

}