首页 > 其他 > 详细

LeetCode – Refresh – Valid Number

时间:2015-03-25 06:29:18      阅读:157      评论:0      收藏:0      [点我收藏+]

Logic is tricky. Redo it.

 1 class Solution {
 2 public:
 3     bool isNumber(string s) {
 4         int start = 0, end = s.size()-1;
 5         if (end == -1) return false;
 6         while (start <= end && s[start] ==  ) start++;
 7         while (end >= start && s[end] ==  ) end--;
 8         bool dotflag = false, expflag = false, numflag = false;
 9         for (int i = start; i <= end; i++) {
10             if (s[i] >= 0 && s[i] <= 9) {
11                 numflag = true;
12             } else if (s[i] == e) {
13                 if (expflag || !numflag) return false;
14                 expflag = true, numflag = false;
15             } else if (s[i] == .) {
16                 if (dotflag || expflag) return false;
17                 dotflag = true;
18             } else if (s[i] == + || s[i] == -) {
19                 if (i > start && s[i-1] != e) return false;
20             } else return false;
21         }
22         return numflag;
23     }
24 };

 

LeetCode – Refresh – Valid Number

原文:http://www.cnblogs.com/shuashuashua/p/4364600.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!