题目链接:https://leetcode-cn.com/problems/most-frequent-number-following-key-in-an-array/
题目如下:
class Solution {
public:
int mostFrequent(vector<int>& nums, int key) {
map<int,int> umap;
bool flag=false;
for(int i=0;i<nums.size()-1;i++){
if(nums[i]==key) { //这里要理解题意
umap[nums[i+1]]++;
}
}
int res=0,cnt=0;
for(auto e:umap){
if(e.second>cnt){
res=e.first;
cnt=e.second;
}
}
return res;
}
};