-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path0008-string-to-integer-atoi.cpp
76 lines (76 loc) · 2.05 KB
/
0008-string-to-integer-atoi.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
class Solution {
public:
int myAtoi(string s) {
string ans;
bool neg = false, pos = false;
bool word = false;
for (int i = 0; i < s.length(); i++)
{
if(s[i] == '-')
{
if(ans.size())
break;
if(pos || ans.size() || neg)
return 0;
else
neg = true;
}
else if(s[i] == '+')
{
if(ans.size())
break;
if(neg || ans.size() || pos)
return 0;
else
pos = true;
}
else if(s[i] == ' ')
{
if(ans.size())
break;
if(pos || neg)
return 0;
}
else if(s[i] == '.')
ans.push_back('.');
else if((s[i] >= 'a' && s[i] <= 'z') ||(s[i] >= 'A' && s[i] <= 'Z'))
{
word = true;
if(!ans.size())
return 0;
if(ans.size())
break;
}
else if(s[i] >= '0' && s[i] <= '9')
{
if(word)
return 0;
ans.push_back(s[i]);
}
}
int k;
for (k = 0; k < ans.length(); k++)
{
if(ans[k] != '0')
break;
}
ans = ans.substr(k);
long long num = 0;
for (int i = 0; i < ans.length(); i++)
{
if(ans[i] == '.')
break;
num = num * 10 + (ans[i] - '0');
if(num > INT_MAX)
{
if(neg)
return INT_MIN;
else
return INT_MAX;
}
}
if(neg)
num *= -1;
return num;
}
};