字符串简单算法

最新推荐文章于 2022-07-28 13:00:42 发布

Sk8？？？

最新推荐文章于 2022-07-28 13:00:42 发布

阅读量188

点赞数

分类专栏：前端

本文链接：https://blog.csdn.net/MRslonly/article/details/98883427

版权

前端专栏收录该内容

27 篇文章 0 订阅

订阅专栏

<!DOCTYPE html>
<html>
<head lang="en">
    <meta charset="UTF-8">
    <title></title>
</head>
<body>
<script>
    /*
     * 找字符串里面的最长的单词
     * */
    var st = "The quick brown fox jumped bcaked jumped abscefg over the lazy dog 15625765675276";
    function showDanci(str) {
        var arr = st.split(" ");
        var temp = arr[0];
        for (var i = 1; i < arr.length; i++) {
            if (temp.length < arr[i].length) {
                temp = arr[i];
            }
        }
        return temp;
    }
    console.log(showDanci(st));

    /*
     * 数组去重
     * */
    var arr = [1, 1, 2, 3, 4, 3, 5, 5, 6, 7, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9];
    function moveNumber(array) {
        for (var i = 0; i < array.length - 1; i++) {
            var temp = array[i];
            for (var k = i + 1; k < array.length; k++) {
                if (temp == array[k]) {
                    array.splice(k, 1);
                    k--;
                }
            }
        }
        return array;
    }
    console.log(moveNumber(arr));

    //字符串的翻转
    var str = "abcdefghi";
    console.log(str.split("").reverse().join(""));


    var s = "";
    for (var i = str.length - 1; i >= 0; i--) {
        s += str.charAt(i);
    }
    console.log(s);

    /*
     *
     * . 统计一个字符串中出现最多的及其出现的次数给出一个字符串，统计出现次数最多的字母。如：“asdfssaaasasasasaa”，其中出现最多的是a
     * */
    var str1 = "cccccccccasdfssaaasasasasaadddddddd";
    function findChar(str) {
        var ss = moveNumber(str.split(""));
        /*[a,c,f,h]*/
        var list = [];
        for (var i = 0; i < ss.length; i++) {
            var count = 0;
            for (var index in str) {
                if (ss[i] == str.charAt(index)) {
                    count++;
                }
            }
            list.push([ss[i], count]);
        }
        var tong = 1;
        for (var i = 0; i < list.length; i++) {
            if (list.length <= tong)break;
            if (list[i][1] > list[i + 1][1]) {
                list.splice(i + 1, 1);
                i--;
            }
            else if (list[i][1] < list[i + 1][1]) {
                list.splice(i, 1);
                i--;
            }
            else {
                tong++;
            }
        }
        return function () {
            var strlist = "";
            for (var i = 0; i < list.length; i++) {
                strlist += list[i][0] + "---" + list[i][1] + "个"
            }
            return strlist;
        }

    }
    console.log(findChar(str1)());


    var ssss = [1, 2, 3, 4, 5];
    var ssss1 = [[0, 1], [0, 1], [0, 1], [0, 1], [0, 1]]
    ssss1[0][0]


    /*
     *  阶乘
     * */
    function jiecheng(n) {
        if (n <= 1) {
            return 1;
        }
        return n * jiecheng(n - 1);
    }
    console.log(jiecheng(5));
 
</script>
</body>
</html>

Sk8？？？

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
字符串简单算法

<!DOCTYPE html><html><head lang="en"> <meta charset="UTF-8"> <title></title></head><body><script> /* * 找字符串里面的最长的单词 * *...
复制链接

扫一扫