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.
思路:
1.首先遍历一遍,使用unorder_map记录出现次数,并找出最大出现次数。
2.再次遍历数组,每次第一次碰到频率最高的那个数字时,从右往左找到该数字,然后做差即为最大长度,然后在这些最大长度中取最小者时间复杂度O(n^2),空间复杂度O(n)。
参考代码:
class Solution {
public:
int findShortestSubArray(vector<int>& nums) {
int mx=0,n=nums.size(),ans=50000;
unordered_map<int,int> mp,ht;
for(int i=0;i<n;++i){
mp[nums[i]]++;
mx=max(mp[nums[i]],mx);
}
for(int i=0;i<n;++i){
if(ht[nums[i]]==1||mp[nums[i]]<mx) continue;
ht[nums[i]]=1; //ht用来标记是否为第一次出现
int k=n-1;
while(k>=0&&nums[k]!=nums[i]) --k;
ans=min(ans,k-i+1);
}
return ans;
}
};
优化:
1.使用一个unordered_map<int,vector<int>> mp,来记录数据,第一次遍历统计数据并找出最大出现次数,其中key=对应数组中的数字nums[i],value中vector[0]记录元素出现次数,vector[1]记录第一次出现的下标,vector[2]记录最后一次出现时的下标。第二次遍历时如果当前元素出现次数等于最大出现次数,v[2]-v[1]+1即为该元素长度,然后取这些长度中的最小者即为答案。
参考代码:
class Solution {
public:
int findShortestSubArray(vector<int>& nums) {
int mx=0,n=nums.size(),ans=50000;
unordered_map<int,vector<int>> mp;
for(int i=0;i<n;++i){
if(mp.find(nums[i])==mp.end()){
mp[nums[i]].push_back(1);
mp[nums[i]].push_back(i);
mp[nums[i]].push_back(i);
}else{
mp[nums[i]][0]++;
mp[nums[i]][2]=i;
}
mx=max(mx,mp[nums[i]][0]);
}
for(auto it=mp.begin();it!=mp.end();it++){
if((it->second)[0]<mx) continue;
ans=min(ans,(it->second)[2]-(it->second)[1]+1);
}
return ans;
}
};