master

分支 (1)

管理

管理

master

Leetcode-js
/
1170. 比较字符串最小字母出现频次.html

<!DOCTYPE html>
<html lang="en">

<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <meta http-equiv="X-UA-Compatible" content="ie=edge">
    <title>Document</title>
</head>

<body>
    <script>
/**
 * @param {string[]} queries
 * @param {string[]} words
 * @return {number[]}
 */
        var numSmallerByFrequency = function (queries, words) {
            function getTimes(str){  //字符串取最小字符出现次数函数。。。
               let times = 0;
               let minChar = str[0];
               for(let s of str){
                   if(s<minChar){
                       minChar = s;
                       times = 1;
                       continue;
                   }
                  if(s===minChar){
                      times++;
                  }
               }
               return times;
            }
            let queriesTimesArr = queries.map(i=>getTimes(i));  //对queries中的字符串元素逐一调用getTimes函数，并返回次数数组
            let wordsTimesArr = words.map(i=>getTimes(i));//同上
            return queriesTimesArr.map(i=>{ //求第二个数组中的元素比第一个中每个元素大的个数，返回一个新数组
                let num = 0;
                wordsTimesArr.forEach(j=>{
                    if(i<j){
                        num++;
                    }
                });
                return num;
            });
        };
     console.log(numSmallerByFrequency(["bbb","cc"],["a","aa","aaa","aaaa"]));
    </script>
</body>

</html>