LeetCode Valid Number

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.

class Solution {
public:
    bool isNumber(const char *s) {
    	int len = (int)strlen(s);
		int left = 0;
		int right = len - 1;
		while(' ' == s[left]) ++left;
		while(' ' == s[right]) --right;
		for(int i = 0; i < len; ++i)
		{
			if('e' == s[i])
				return isNumber(s, left, i-1) && isInteger(s, i+1, right);
		}
		return isNumber(s, left, right);
    }

	bool isNumber(const char* s, int start, int end)
	{
		if(start <= end)
		{
			int cur = start;
			bool hasDot = false;
			bool hasDigit = false;
			if('+' == s[cur] || '-' == s[cur])
				++cur;
			for(int i = cur; i <= end; ++i)
			{
				char ch = s[i];
				if(ch >= '0' && ch <= '9')
				{
					hasDigit = true;
					continue;
				}
				if('.' == ch && !hasDot)
					hasDot = true;
				else
					return false;
			}
			return hasDigit;
		}
		return false;
	}
	bool isInteger(const char* s, int start, int end)
	{
		if(start <= end)
		{
			bool hasDigit = false;
			if('+' == s[start] || '-' == s[start])
				++start;
			for(int i = start; i <= end; ++i)
				if(s[i] >= '0' && s[i] <= '9')
					hasDigit = true;
				else
					return false;
			return hasDigit;
		}
	}
};


评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值