获得徽章 0
// 最长公共前缀const getStr = (arr) => {
if (Array.isArray(arr)) {
switch (arr.length) {
case 1:
return arr[0]
case 0:
return ''
default:
return arr.reduce((v1, v2) => {
const len = v1.length;
let ns = ''
for(let i = 0; i < len; i++) {
if (v1.charAt(i) === v2.charAt(i)) {
ns += v1.charAt(i)
}
}
return ns
})
}
} else {
return ''
}
}
if (Array.isArray(arr)) {
switch (arr.length) {
case 1:
return arr[0]
case 0:
return ''
default:
return arr.reduce((v1, v2) => {
const len = v1.length;
let ns = ''
for(let i = 0; i < len; i++) {
if (v1.charAt(i) === v2.charAt(i)) {
ns += v1.charAt(i)
}
}
return ns
})
}
} else {
return ''
}
}
展开
评论
点赞
// 反转const reverse = (num) => {
if (num < Math.pow(2, 31) && num > -(Math.pow(2, 31) - 1)) {
const numStrs = (''+num).split('')
let numarr = []
let idx = 0
for (let i = numStrs.length - 1; i >= 0; i--) {
numarr[idx] = numStrs[i]
idx++
}
if (numarr[numStrs.length - 1] === '-') {
numarr = numarr.slice(0, -1).join('') * -1
} else {
numarr = numarr.slice(0, -1).join('') * 1
}
return numarr
}
return 0
}
if (num < Math.pow(2, 31) && num > -(Math.pow(2, 31) - 1)) {
const numStrs = (''+num).split('')
let numarr = []
let idx = 0
for (let i = numStrs.length - 1; i >= 0; i--) {
numarr[idx] = numStrs[i]
idx++
}
if (numarr[numStrs.length - 1] === '-') {
numarr = numarr.slice(0, -1).join('') * -1
} else {
numarr = numarr.slice(0, -1).join('') * 1
}
return numarr
}
return 0
}
展开
1
点赞