697. Degree of an Array(Leetcode每日一题-2021.02.20)-CSDN博客

本文链接：https://blog.csdn.net/sjt19910311/article/details/113888188

此篇博客介绍了如何解决一个编程问题，即给定一个整数数组，找到具有最大频率元素的最短连续子数组。通过哈希表记录元素出现的位置和频率，找出具有相同频率的最短子数组长度。适合学习数据结构和算法优化技巧。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem

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.

Constraints:

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

Example1

Input: nums = [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.

Example2

Input: nums = [1,2,2,3,1,4,2]
Output: 6
Explanation:
The degree is 3 because the element 2 is repeated 3 times.
So [2,2,3,1,4,2] is the shortest subarray, therefore returning 6.

Solution

用哈希表记录每个数字出现的最左和最右位置以及出现的次数。

class Solution {
public:
    int findShortestSubArray(vector<int>& nums) {
        unordered_map<int,int> counter;
        unordered_map<int,int> left_pos;
        unordered_map<int,int> right_pos;

        for(int i = 0;i<nums.size();++i)
        {
            counter[nums[i]]++;
            if(!left_pos.count(nums[i]))
            {
                left_pos[nums[i]] = i;
            }
            right_pos[nums[i]] = i;
        }

        int degree = 0;
        for(auto [key,val]:counter)
        {
            degree = max(degree,val);
        }

        int ret = INT_MAX;
        for(int i = 0;i<nums.size();++i)
        {
            if(counter[nums[i]] == degree)
            {
                ret = min(ret,right_pos[nums[i]] - left_pos[nums[i]] + 1);
            }
        }

        return ret;


    }
};