2020-11-07L 697数组的度

coderLcy

于 2021-02-07 21:08:30 发布

阅读量57

点赞数

分类专栏：每日一题

本文链接：https://blog.csdn.net/qq_44805237/article/details/109543230

版权

每日一题专栏收录该内容

208 篇文章 2 订阅

订阅专栏

var findShortestSubArray = function(nums) {
    let len = nums.length;
    let count = 1;
    let max = 1;
    let minSub = 1;
    for(let i = 0; i < len; i++){
        for(let j = i+1; j < len; j++){
            if(nums[i] == nums[j]){
                count++;        
                if(count > max){
                    max = count;
                     minSub = j - i + 1;         
                }else if(count == max){
                    if(minSub > j - i + 1){
                        minSub = j - i + 1;
                    } 
                }
            }
        }
        count = 1;
    }
    return minSub;
};