leetcode/algorithms/DegreeOfAnArray/solution.js at master · P-ppc/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
/**
 * @param {number[]} nums
 * @return {number}
 */
var findShortestSubArray = function(nums) {
    let numsMap = {},
        mostNums = [],
        maxCount = 0

    for (let i = 0; i < nums.length; i++) {
        let num = nums[i]

        if (numsMap[num] === undefined) {
            numsMap[num] = {
                start: i,
                end: i,
                count: 1
            }
        } else {
            numsMap[num].end = i
            numsMap[num].count += 1
        }

        if (numsMap[num].count > maxCount) {
            maxCount = numsMap[num].count
            mostNums = [num]
        } else if (numsMap[num].count === maxCount) {
            mostNums.push(num)
        }
    }

    return Math.min(...mostNums.map(num => numsMap[num].end - numsMap[num].start + 1))
};