[leetcode_65]Valid Number

这个题判断一个数是否为数,不过输入样例太扯。。。或许是自己太水,我的定义和样例的定义不一样,改了好久,难怪这个题的AC率这么低。

 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
class Solution {
public:
    bool isNumber(const char *s) {
        string str = "";
        int len = strlen(s);
        int i = 0;
        for(;i < len;i++) {
            if(s[i] == ' ')continue;
            else break;
        }
        for(;i < len;i++) {
            str.push_back(s[i]);
        }
        for(int i = str.length()-1;i >= 0;i--) {
            if(str[i] == ' ') {
                str.erase(i);
            }
            else
                break;
        }
        return isNumberString(str);
    }
private:
    bool isNumberString(string s) {
        //是否有正负号
        //是否带小数点
        //是否含e
        //是否有前置0
        int len = s.length();
        if(len <= 0)return false;
        if(len == 1) {
            if(s[0] < '0' || s[0] > '9')return false;
            else return true;
        }
        int start = 0;
        if(s[0] == '+' || s[0] == '-') {
            start = 1;
        }
        bool isZeroAllowed = true;
        bool isPotAllowed = false;
        bool isEallowed = false;

        bool once = true;

        if(s[start] == '.') {
            if(len >= start + 2) {
                if(s[start + 1] >= '0' && s[start + 1] <= '9') {
                    isZeroAllowed = true;
                    isPotAllowed = false;
                    isEallowed = true;
                    once = false;
                    start = start + 2;  
                }
                else
                    return false;
            }
            else 
                return false;
        }
        for(int i = start;i < len;i++) {
            if(s[i] == '.' && isPotAllowed == false) {
                return false;
            }
            if(s[i] == '.' && isPotAllowed == true) {
                isPotAllowed = false;
                continue;
            }
            if(s[i] == 'e' && isEallowed == false) {
                return false;
            }
            if(s[i] == 'e' && isEallowed == true) {
                isEallowed = false;
                isPotAllowed = false;
                once = false;
                if(i + 1 >= len)return false;
                if(s[i+1] == '-' || s[i+1] == '+') {
                    if(i+2 >= len)return false;
                    if(s[i+2] < '0' || s[i+2] > '9')return false;
                    i+=2;
                    continue;
                } 
                if(s[i+1] < '0' || s[i+1] > '9')return false;
                continue;
            }
            if(s[i] >= '0' && s[i] <= '9') {
                if(once == true) {
                    isZeroAllowed = true;
                    isPotAllowed = true;
                    isEallowed = true;

                    once = false;
                }
                continue;
            }
            return false;
        }
        return true;
    }
};
Licensed under CC BY-NC-SA 4.0