65有效数字

验证给定的字符串是否可以解释为十进制数字。

例如:

"0" => true
" 0.1 " => true
"abc" => false
"1 a" => false
"2e10" => true
" -90e3   " => true
" 1e" => false
"e3" => false
" 6e-1" => true
" 99e2.5 " => false
"53.5e93" => true
" --6 " => false
"-+3" => false
"95a54e53" => false

说明: 我们有意将问题陈述地比较模糊。在实现代码之前，你应当事先思考所有可能的情况。这里给出一份可能存在于有效十进制数字中的字符列表：

    数字 0-9
    指数 - "e"
    正/负号 - "+"/"-"
    小数点 - "."

当然，在输入中，这些字符的上下文也很重要。

更新于 2015-02-10:
C++函数的形式已经更新了。如果你仍然看见你的函数接收 const char * 类型的参数，请点击重载按钮重置你的代码。

//自动机 状态转移图 条件 状态太多太容易出错了
//注意点
//1 table初始化时括号的位置
//2 返回true的结果可能是多个，不唯一
//3 前后空格情况："  1.2e-3  " true
//4 小数点前后有没有数字情况： " -.2e-3 " true    " +1.e-3 " true    ".e-3 " false
//5 用int代替string表示状态名称应该可以更快

//一个究极完整的数字里面的可以分为 SA.BeCS or SA.eCS or S.BeCS
//S: 连续空格
//A：可带符号数
//B：无符号数字
//C：可带符号数
class Solution {
    unordered_map<string,vector<string>>table{//vector的大小等于转移条件的总个数
        {"start",{"S2","S1","S3_1","S8","start","S8"}},
        {"S1",{"S2","S8","S3_1","S8","S8","S8"}},
        {"S2",{"S2","S8","S3_2","S5","S9","S8"}},
        {"S3_1",{"S3_2","S8","S8","S8","S8","S8"}},
        {"S3_2",{"S4","S8","S8","S5","S9","S8"}},
        {"S4",{"S4","S8","S8","S5","S9","S8"}},
        {"S5",{"S7","S6","S8","S8","S8","S8"}},
        {"S6",{"S7","S8","S8","S8","S8","S8"}},
        {"S7",{"S7","S8","S8","S8","S9","S8"}},
        {"S8",{"S8","S8","S8","S8","S8","S8"}},
        {"S9",{"S8","S8","S8","S8","S9","S8"}},
    };    
public:
    bool isNumber(string s) {
        string state="start";
        for(auto c:s)
            state=table[state][getIndex(c)];
        if(state=="S2"||state=="S4"||state=="S7"||state=="S9"||state=="S3_2")
            return true;
        else return false;
    }
    int getIndex(char c){
        if(isdigit(c))return 0;
        if(c=='+'||c=='-')return 1;
        if(c=='.')return 2;
        if(c=='e')return 3;
        if(c==' ')return 4;
        return 5;

//方法二：一遍扫描 正则表达式
//去头空格
//有无符号
    //连续数字.e
    //.连续数字e
    //连续数字.连续数字e
//有无符号
//连续数字
//去尾空格