[Leetcode] Degree the degree of an array of arrays

Given a non-empty array of non-negative integers nums , the degree of this array are defined as the maximum frequency of an Y one of its elements.

Your task is to find the smallest possible length of a (contiguous) Subarray nums of, which has the same degree as nums .

Example 1:

Input: [1, 2, 2, 3, 1]output:2explanation:the input array has a degree of 2 because both elements 1 and 2 appear TWICE.O f The subarrays that has the same degree:[1, 2, 2, 3, 1], [1, 2, 2, 3], [2, 2, 3, 1], [1, 2, 2], [2, 2, 3], [2, 2]the Sho Rtest length is 2. So return 2.

Example 2:

Input: [1,2,2,3,1,4,2]output:6

Note:

• nums.lengthwould be between 1 and 50,000.
• nums[i]'ll is an integer between 0 and 49,999.

S

[Leetcode] Degree the degree of an array of arrays