LCR 178.训练计划VI

1.题目要求:

2.题目代码:

class Solution {
public:
    int trainingPlan(vector<int>& actions) {
        //设置multimap容器，记录每个元素的次数
        multimap<int,int> array;
        for(int i = 0;i < actions.size();i++){
            multimap<int,int> :: iterator it = array.find(actions[i]);
            if(it != array.end()){
                it->second += 1;
            }else{
                array.insert(make_pair(actions[i],1));
            }
        }
        //遍历multimap容器,找到出现次数为1的次数返回此元素
        for(multimap<int,int>:: iterator it = array.begin();it != array.end();it++){
            if(it->second == 1){
                return it->first;
            }
        }
        return 0;
    }
};