Degree of an Array问题及解法

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

我们要爱学习

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

阅读量1.3k

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode算法练习（Medium）文章标签： LeetCode Easy

本文链接：https://blog.csdn.net/u011809767/article/details/78248289

LeetCode算法练习（Medium）专栏收录该内容

238 篇文章

订阅专栏

本文介绍了一种算法，用于解决寻找数组中最短的、具有最大出现次数的子数组问题。该算法通过统计每个元素的出现频率及位置，确定出现频率最高的元素及其最短子数组长度。

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

问题描述：

Give a string s, count the number of non-empty (contiguous) substrings that have the same number of 0's and 1's, and all the 0's and all the 1's in these substrings are grouped consecutively.

Substrings that occur multiple times are counted the number of times they occur.

示例:

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.

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

问题分析：

统计每个元素出现的次数，每个元素开始出现的位置和最后出现的位置，找到出现次数最多的元素的在数组中的最短长度即可。

过程详见代码：

class Solution {
public:
    int findShortestSubArray(vector<int>& nums) {
        unordered_map<int, pair<int, int>> m1;
		unordered_map<int, int> m2;
		int count = 0,res = nums.size();
		for (int i = 0; i < nums.size(); i++)
		{
			m2[nums[i]]++;
			if (m1.find(nums[i]) == m1.end()) m1[nums[i]] = pair<int, int>(i, i);
			else m1[nums[i]].second = i;
			if (m2[nums[i]] > count) count = m2[nums[i]];
		}
		for (auto num : m2)
		{
			if (count == num.second)
			{
				res = min(res, m1[num.first].second - m1[num.first].first + 1);
			}
		}
		return res;
    }
};