beats 66%
public class Solution {
public int myAtoi(String str) {
String myStr=str.trim();
if(myStr.equals(""))
return 0;
char curChar;
long result=0l;
int sign=1;
int startIndex=0;
if(myStr.charAt(0)=='-'){
sign=-1;
startIndex=1;
}
else if(myStr.charAt(0)=='+'){
startIndex=1;
}
if(startIndex>=myStr.length())
return 0;
curChar=myStr.charAt(startIndex);
if(curChar<'0' || curChar>'9')
return 0;
for(int i=startIndex;i<myStr.length();i++){
curChar=myStr.charAt(i);
if(curChar>='0' && curChar<='9')
result=result*10+(curChar-'0');
else
break;
if(result>Integer.MAX_VALUE){
if(sign==1)
return Integer.MAX_VALUE;
else{
if(-1*result<Integer.MIN_VALUE)
return Integer.MIN_VALUE;
}
}
}
return (int)(sign*result);
}
}