写一个函数,接受一个字符串作为参数,返回字符串中出现次数最多的字符及其出现次数。
function strCount(str) {
let strArr = str.split("")
let countObj = strArr.reduce((all, key) => {
if (all[key] ) {
all[key] += 1
} else {
all[key] = 1
}
return all
}, {})
let maxStr = ''
let maxCount = 0
for(let arr in countObj){
if(countObj[arr]> maxCount){
maxStr = arr
maxCount = countObj[arr]
}
}
console.log(`出现最多次数的字符是:${maxStr},次数是:${maxCount}`);
}
strCount('sadffghjllkhjhgfdw3ertyuiooiuytrezxccvbnm')
strCount('bbbbbbbbbbbbbbbbbbbbbbbassssssssssssssssssssssssd')
给定一个字符串,找到最长的子串,其中不含重复字符
function strNepeat(str) {
let obj = {}
let string = ''
for (let s of str) {
if (obj[s]) {
console.log( '最长子串',string);
break
} else {
string += s
obj[s] = 1
}
}
return string
}
strNepeat('asdfjkghqwesdfgsss')
strNepeat('asdfas')