[LeetCode] Degree of an Array 数组的度

Posted Grandyang

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LeetCode] Degree of an Array 数组的度相关的知识,希望对你有一定的参考价值。

 

 

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

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

Example 1:

Input: [1, 2, 2, 3, 1]
Output: 2
Explanation: 
The input array has a degree of 2 because both elements 1 and 2 appear twice.
Of the subarrays that have 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 shortest length is 2. So return 2.

 

Example 2:

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

 

Note:

  • nums.length will be between 1 and 50,000.
  • nums[i] will be an integer between 0 and 49,999.

 

s

 

以上是关于[LeetCode] Degree of an Array 数组的度的主要内容,如果未能解决你的问题,请参考以下文章

leetcode-697-Degree of an Array

697. Degree of an Array - LeetCode

leetcode 之 Degree of an Array

[leetcode]Array-697. Degree of an Array

[LeetCode] Degree of an Array 数组的度

leetCode-Degree of an Array