TA貢獻1802條經(jīng)驗 獲得超5個贊
沒有想到正則的方法，自己寫了一個函數(shù)：
檢測序列是0123456789:
function isContinue(str) {
let diff = +str[1] - +str[0]
diff = diff < 0 ? diff + 10 : diff
let former = +str[0]
for (let i = 1; i < str.length; i++) {
let cur0 = +str[i]
let cur1 = former + diff
cur1 = cur1 < 0 ? cur1 + 10 : cur1 % 10
if (cur0 !== cur1) return false
former = cur0
}
return true
}
console.log(isContinue('987654')) // true
console.log(isContinue('432109')) // true
console.log(isContinue('123456')) // true
console.log(isContinue('901234')) // true
console.log(isContinue('201235')) // false
檢測的序列是123456789:
function isContinue(str) {
let base = 9
let strArray = []
for (let i = 0, len = str.length; i < len; i++) {
let j = +str[i] - 1
strArray[i] = j < 0 ? j + base : j
}
str = strArray.join('')
let diff = +str[1] - +str[0]
diff = diff < 0 ? diff + base : diff
let former = +str[0]
for (let i = 1; i < str.length; i++) {
let cur0 = +str[i]
let cur1 = former + diff
cur1 = cur1 < 0 ? cur1 + base : cur1 % base
if (cur0 !== cur1) return false
former = cur0
}
return true
}
console.log(isContinue('987654')) // true
console.log(isContinue('432198')) // true
console.log(isContinue('123456')) // true
console.log(isContinue('912345')) // true
console.log(isContinue('901234')) // false
TA貢獻1818條經(jīng)驗 獲得超8個贊
function fun(str) {
if (str.length < 2)
return false;
var t = str.charCodeAt(0) - str.charCodeAt(1);
for (var i = 0,l=str.length; i < l - 1; i++)
if ((str.charCodeAt(i) - str.charCodeAt(i + 1)) != t)
return false;
return true;
}
fun('123456')
正則的話太麻煩了
舉報