-
Notifications
You must be signed in to change notification settings - Fork 0
/
65.cpp
104 lines (96 loc) · 2.04 KB
/
65.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
class Solution {
public:
bool isNumber(string s) {
bool ret = false;
int i = 0;
// space
while(s[i] == 32)
{
++i;
}
// - or +
if(s[i] == 45 || s[i] == 43)
{
++i;
}
int len = s.size();
bool hasDot = false;
bool hasE = false;
bool hasPart1 = false;
bool hasPart2 = false;
for(; i < len; ++i)
{
// .
if(s[i] == 46 )
{
if(hasDot || hasE || (i == 0 && i == len - 1))
{
return false;
}
else
{
hasDot = true;
}
}
// e
else if(s[i] == 101)
{
if(hasE || !hasPart1)
{
return false;
}
else
{
hasE = true;
}
}
// number
else if(s[i] >= 48 && s[i] <= 57)
{
if (!hasE)
{
hasPart1 = true;
}
else
{
hasPart2 = true;
}
}
// - or +
else if(s[i] == 45 || s[i] == 43)
{
if (!hasE || !(s[i-1] == 101))
return false;
}
// space
else if(s[i] == 32)
{
while(s[i] == 32)
{
++i;
}
break;
}
else
{
return false;
}
}
if (!hasPart1)
{
return false;
}
else if (hasE && !hasPart2)
{
return false;
}
else if (i != len)
{
return false;
}
else
{
return true;
}
}
};