前端算法题汇集 - 字符类

查看更多资源

1. 判断单词是否是回文

function isHuiWen(str){
  return str == str.split('').reverse().join('');
}

let str = 'abcdcba';
console.log(isHuiWen(str)) //true

2. 查找连续字符串中出现次数最多的字符

function findMaxnumChar(str) {
    if(str.length == 1){
        return str;
    }
    let charObj = {}; // 统计每个字符出现的次数
    for (let i=0;i<str.length;i++) {
        if(!charObj[str.charAt(i)]){
            charObj[str.charAt(i)] = 1;          
        }else{
            charObj[str.charAt(i)] += 1;
        }
    };
    console.log(charObj)
    let maxnumChar = '';
    let maxNum = 1;
    for (let key in charObj) { // 查找次数最多的字符
        if(charObj[key] >= maxNum){
            maxnumChar = key;
            maxNum = charObj[key];
        }
    }
    return maxnumChar;
    
}
let str = 'adfsfsafadafasdfssssssssssss';
console.log(findMaxnumChar(str))  // s

3. 随机生成指定长度的字符串

function randomString(num) {
    let str = 'abcdefghijklmnopqrstuvwsyz0123456789';
    let len = str.length;
    let rString = '';
    for (let i=0;i<num;i++) {
        rString += str.charAt(Math.floor(Math.random()*len))
    }
    return rString;
}

console.log(randomString(20));

4. 翻转字符串

function reserveString(str){
    return str.split('').reverse().join('');
}

console.log(reserveString('hello javaScript'))