[Leetcode] 697. Degree of an Array 解题报告

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

魔豆Magicbean

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

阅读量309

点赞数

CC 4.0 BY-SA版权

分类专栏： IT公司面试习题文章标签： Leetcode 解题报告 Array

本文链接：https://blog.youkuaiyun.com/magicbean2/article/details/79249549

IT公司面试习题专栏收录该内容

736 篇文章

订阅专栏

本文介绍了一种高效算法，用于找到具有与整个数组相同度数的最短连续子数组。通过使用哈希表来记录每个元素的所有索引，并确定出现频率最高的元素及其对应的最短子数组长度。

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

题目：

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.

思路：

首先定义一个哈希表，建立每个数字到其所有索引之间的映射。然后找出所有出现次数最多的数字。对于每个数字，计算其对应的最短子串（就是其第一次出现的位置和最后一次出现的位置之间的字符构成的子串）的长度。最后返回所有数字中最短子串的最短长度即可。

代码：

class Solution {
public:
    int findShortestSubArray(vector<int>& nums) {
        unordered_map<int, vector<int>> hash;   // num -> indices
        int max_frequency = 0;
        vector<int> max_freq_nums;
        for (int i = 0; i < nums.size(); ++i) {
            hash[nums[i]].push_back(i);
            if (hash[nums[i]].size() > max_frequency) {
                max_frequency = hash[nums[i]].size();
                max_freq_nums.clear();
                max_freq_nums.push_back(nums[i]);
            }
            else if (hash[nums[i]].size() == max_frequency) {
                max_freq_nums.push_back(nums[i]);
            }
        }
        int ret = INT_MAX;
        for (auto num : max_freq_nums) {
            ret = min(ret, hash[num].back() - *hash[num].begin() + 1);
        }
        return ret;
    }
};