LeetCode 697. Degree of an Array

最新推荐文章于 2022-08-23 20:19:29 发布

原创最新推荐文章于 2022-08-23 20:19:29 发布 · 237 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 题解 C++版专栏收录该内容

138 篇文章

订阅专栏

本文解析了LeetCode上Degree of an Array题目，详细介绍了如何寻找数组中具有最高频率元素的最短连续子数组长度。通过使用unordered_map进行元素频率及位置记录，实现了高效求解。

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

Degree of an Array - LeetCode

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.

map操作

class Solution {
public:
    unordered_map<int, pair<int, int>> map1;
    unordered_map<int, int> numscount;
    int degree = 0, ans = INT_MAX;
    int findShortestSubArray(vector<int>& nums) {
        for (int i = 1; i <= nums.size(); i ++ ) {
            int cur = nums[i-1];
            if (!map1[cur].first) map1[cur].first = i;
            if (i > map1[cur].second) map1[cur].second = i;
            numscount[cur] ++;
            degree = max(degree, numscount[cur]);
        }
        for (int i = 1; i <= nums.size(); i ++ ) {
            int cur = nums[i-1];
            if (degree == numscount[cur])
                ans = min(ans, map1[cur].second - map1[cur].first + 1);
        }
       
        return ans;
    }
};