首页 > 其他 > 详细

LeetCode - Valid Number

时间:2015-12-30 06:59:30      阅读:192      评论:0      收藏:0      [点我收藏+]

题目:

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.

思路:

正则表达式

package others;

public class ValidNumber {

    public boolean isNumber(String s) {
        return s.matches("^\\s*[+-]?(\\d+|\\d*\\.\\d+|\\d+\\.\\d*)([eE][+-]?\\d+)?\\s*$");
    }
    
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        ValidNumber v = new ValidNumber();
        System.out.println(v.isNumber("3.1"));
        System.out.println(v.isNumber("- 8.9"));
        System.out.println(v.isNumber("2."));
        System.out.println(v.isNumber("abc"));
        System.out.println(v.isNumber("e10"));
        System.out.println(v.isNumber("5e10"));
    }

}

 

LeetCode - Valid Number

原文:http://www.cnblogs.com/shuaiwhu/p/5087614.html

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