LeetCode 65. Valid Number ---简洁高效8ms

/************************************************************************
*
* Validate if a given string is numeric.
*
* Some examples:
* “0” => true
* ” 0.1 ” => true
* “abc” => false
* “1 a” => false
* “2e10” => true
*
* Note: It is intended for the problem statement to be ambiguous.
* You should gather all requirements up front before implementing one.
*
*
************************************************************************/
此题非常繁琐，改了好久，都有漏洞，参考了网友的程序，所得如下代码非常的简洁，同时又很高效。

bool isNumber(string s) {
    if (s.empty()) return false;
    int i = 0, len = s.size(), count_point = 0, count_num = 0, count_e = 0;
    while (i<len && s[i] == ' ') ++i; //去除空格
    if (i<len && (s[i] == '+' || s[i] == '-')) ++i;  //正负数
    while (i<len && (isdigit(s[i]) || s[i] == '.'))  //数字或.
        s[i++] == '.' ? ++count_point : ++count_num; //有两个. 或者没有数字，一定false
    if (count_point>1 || count_num<1) return false;  //有一个或没有.，有大于1个数字，一定为真，注意1.为真
    if (i<len && s[i] == 'e') {
        ++i;
        if (i<len && (s[i] == '+' || s[i] == '-')) ++i; //e后面可以有+，-
        while (i<len && isdigit(s[i])) { ++i; ++count_e; }
        if (count_e<1) return false;  //e后面必须有数字
    }
    while (i<len && s[i] == ' ') ++i;
    return i == len;
}