本文共 603 字，大约阅读时间需要 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;};

转载地址：http://nhtzi.baihongyu.com/