Leetcode NO.65 Valid Number

本题题目要求如下：

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.

本题难度是hard，但个人认为这题的思路不难，就是把所有的限制全都用代码写出来，没有太多技巧可言，而且我写的代码逻辑性也不强，基本得通过调试，不断的改写代码，差不多调了10次以上才最后通过的。。。。当然可能我对这道题的认识比较浅显，如果大家有更好的思路，希望不吝赐教。

这题没有思路可言，觉得面试也不会考这种题，直接上代码：

class Solution {
public:
    bool isNumber(string s) {
    	bool digit = false;
    	bool start = false;
    	bool end = false;
    	bool dot = false;
    	bool e = false;
        for (int i = 0; i < s.size(); ++i) {
        	if (s[i] == ' ') {
        		if (start == true)
        			end = true;
        	}
        	else {
        		if (s[i] >= '0' and s[i] <= '9') {
        			if (digit == false)
        				digit = true;
        			if (start == false)
        				start = true;
        			if (end == true)
        				return false;
        		}
        		else if (s[i] == '-' or s[i] == '+') {
        			if (start == true and s[i-1] != 'e' or i + 1 == s.size())
        				return false;
        			start = true;
        		}
        		else if (s[i] == '.') {
        			if (end == true or dot == true)
        				return false;
        			if (start == false)
        				start = true;
        			dot = true;
        		}
        		else if (s[i] == 'e') {
        			if (start == false or digit == false or end == true or e == true)
        				return false;
        			e = true;
        			dot = true;
        			if (i + 1 == s.size() or s[i+1] == ' ' or s[i+1] == '.')
        				return false;
        		}
        		else
        			return false;
        	}
        }
        if (start == true and digit == true)
        	return true;
        else
        	return false;
    }
};