验证给定的字符串是否可以解释为十进制数字。
例如:
“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”
正/负号 - “+”/“-“
小数点 - “.”
当然,在输入中,这些字符的上下文也很重要。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/valid-number
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79
| class Solution(object): def isNumber(self, s): """ :type s: str :rtype: bool """ head = "" tail = "" s = s.strip() if not s: return False items = s.split('e') legal = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9'} if len(items) > 2: return False if len(items) == 2: head = items[0] tail = items[1] if not head or not tail: return False if len(items) == 1: head = items[0] if tail: if '.' in tail: return False if tail[0] in {'+', '-'}: tail = tail[1:] if not tail: return False for i in tail: if i not in legal: return False if head: sign = False items = head.split('.') integer, fraction = '', '' if len(items) > 2: return False if len(items) == 1: integer = items[0] if len(items) == 2: integer = items[0] fraction = items[1] if integer and integer[0] in {'+', '-'}: integer = integer[1:] if not integer and not fraction: return False for i in integer: if i not in legal: return False for i in fraction: if i not in legal: return False return True
|