题目:[1]
请实现一个函数用来判断字符串是否表示数值(包括整数和小数)。
例如,字符串"+100"、"5e2"、"-123"、"3.1416"、"-1E-16"、"0123"都表示数值,但"12e"、"1a3.14"、"1.2.3"、"+-5"及"12e+5.4"都不是。
抛砖引玉
思路
数组只包含正负号和 e、E、点(.),且 e 之后不能有小数点
首先来两个最方便的方法
/**
* @param {string} s
* @return {boolean}
*/
var isNumber = function (s) {
return /^[+-]?(\d+(\.\d*)?|(\.\d+))(e[+-]?\d+)?$/i.test(s.trim())
}
var isNumber = function (s) {
if (!s.trim()) return false
return isNaN(Number(s))
}
官方提供的确定有限状态自动机解法[2]
根据每个位置可能放置的字符及其后面可能包含的字符,形成字符连接的组合,然后遍历字符根据组合校验
' ' | s | d | e | . |
---|---|---|---|---|
空格 | 正负号 | 数字 | 字符 e | 小数点 |
var isNumber = function (s) {
let states = [
new Map([[' ', '0'],['d', '2'],['.', '4'],['s', '1']]),
new Map([['d', '2'],['.', '4']]),
new Map([['d', '2'],['e', '6'],['.', '3'],[' ', '9']]),
new Map([['d', '5'],['e', '6'],[' ', '9']]),
new Map([['d', '5']]),
new Map([['d', '5'],['e', '6'],[' ', '9']]),
new Map([['d', '8'],['s', '7']]),
new Map([['d', '8']]),
new Map([['d', '8'],[' ', '9']]),
new Map([[' ', '9']])
]
let num = 0,
t = ''
for (let i = 0; i < s.length; i++) {
if ('0' <= s[i] && s[i] <= '9') {
t = 'd'
} else if (s[i] == '+' || s[i] == '-') {
t = 's'
} else if (s[i] == 'e' || s[i] == 'E') {
t = 'e'
} else if (s[i] == '.' || s[i] == ' ') {
t = s[i]
} else {
t = 'N'
}
if (!states[num].has(t)) return false
num = states[num].get(t)
}
return num == 2 || num == 3 || num == 5 || num == 8 || num == 9
}
[1]
题目:: https://leetcode-cn.com/problems/biao-shi-shu-zhi-de-zi-fu-chuan-lcof/
[2]
确定有限状态自动机解法: https://leetcode-cn.com/problems/biao-shi-shu-zhi-de-zi-fu-chuan-lcof/solution/biao-shi-shu-zhi-de-zi-fu-chuan-by-leetcode-soluti/