您的位置:首页 > 其它

leetcode 54: String to Integer (atoi)

2013-01-26 19:51 543 查看
String to Integer (atoi)Dec
27 '11

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.

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.

class Solution {
public:
int atoi(const char *str) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
//  13141423
bool negative = false;

while(*str == ' ') ++str;
if(*str == '-') {
negative = true;
++str;
}
if(*str == '+') ++str;

long long res = 0;
while(*str!='\0'){
if( *str>='0' && *str<='9') {
res = res*10 + *str - '0';
} else {
break;
}
++str;
}
res = negative ? -res : res;

if(res>INT_MAX) return INT_MAX;
else if(res<INT_MIN) return INT_MIN;
else return res;
}
};


java version . can not process INT_MIN INT_MAX.

public class Solution {
public int atoi(String str) {
// Start typing your Java solution below
// DO NOT write main() function
if(str==null || str.length()==0) return 0;

char[] arr = str.toCharArray();
int i=0;

boolean space = false;
boolean num = false;
boolean negative = false;

while(arr[i]==' ') i++;
if(arr[i]=='-') {
negative = true;
++i;
}
if(arr[i]=='+') ++i;

long sum = 0;

for( ; i<arr.length; i++) {
if(arr[i] == ' ') {
space = true;
} else if( space == true) {
break;
} else if( arr[i]>= '0' && arr[i]<='9') {
num = true;
sum = sum*10 + arr[i]-'0';
} else {
break;
}
}

return (int) (negative ? -sum : sum);
}
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: