-
Notifications
You must be signed in to change notification settings - Fork 22
/
Copy path8.string-to-integer-atoi.cpp
151 lines (134 loc) · 4.02 KB
/
8.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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
/*
* [8] String to Integer (atoi)
*
* https://leetcode.com/problems/string-to-integer-atoi/description/
*
* algorithms
* Medium (14.12%)
* Total Accepted: 259.4K
* Total Submissions: 1.8M
* Testcase Example: '"42"'
*
* Implement atoi which converts a string to an integer.
*
* 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.
*
* Note:
*
*
* Only the space character ' ' is considered as whitespace character.
* Assume we are dealing with an environment which could only store integers
* within the 32-bit signed integer range: [−231, 231 − 1]. If the numerical
* value is out of the range of representable values, INT_MAX (231 − 1) or
* INT_MIN (−231) is returned.
*
*
* Example 1:
*
*
* Input: "42"
* Output: 42
*
*
* Example 2:
*
*
* Input: " -42"
* Output: -42
* Explanation: The first non-whitespace character is '-', which is the minus
* sign.
* Then take as many numerical digits as possible, which gets 42.
*
*
* Example 3:
*
*
* Input: "4193 with words"
* Output: 4193
* Explanation: Conversion stops at digit '3' as the next character is not a
* numerical digit.
*
*
* Example 4:
*
*
* Input: "words and 987"
* Output: 0
* Explanation: The first non-whitespace character is 'w', which is not a
* numerical
* digit or a +/- sign. Therefore no valid conversion could be performed.
*
* Example 5:
*
*
* Input: "-91283472332"
* Output: -2147483648
* Explanation: The number "-91283472332" is out of the range of a 32-bit
* signed integer.
* Thefore INT_MIN (−231) is returned.
*
*/
class Solution {
public:
int myAtoi(string str) {
int res = 0;
int sign = 1;
for (int i = 0; i < str.size(); i++) {
if (str[i] == ' ') {
continue;
}
if (str[i] == '+' || str[i] == '-') {
sign = str[i++] == '-' ? -1 : 1;
}
while (str[i] >= '0' && str[i] <= '9') {
int digit = (str[i] - '0') * sign;
if (res > INT_MAX / 10 || (res == INT_MAX / 10 && digit > 7)) return INT_MAX;
if (res < INT_MIN / 10 || (res == INT_MIN / 10 && digit < -8)) return INT_MIN;
res = res * 10 + digit;
i++;
}
break;
}
return res;
}
};
class Solution2 {
public:
int myAtoi(string str) {
int sign = 1;
int num = 0;
for (int i = 0; i < str.length(); ++i) {
if (str[i] == ' ') {
continue;
}
if (str[i] == '+' || str[i] == '-') {
sign = (str[i++] == '-') ? -1 : 1;
}
while (str[i] >= '0' && str[i] <= '9') {
int digit = (str[i++] - '0');
if (num > INT_MAX / 10) {
return sign > 0 ? INT_MAX : INT_MIN;
}
if (num == INT_MAX / 10 && digit > INT_MAX % 10) {
return sign > 0 ? INT_MAX : INT_MIN;
}
num = num * 10 + digit;
}
return sign * num;
}
return 0;
}
};