LeetCode #911 - Online Election

题目描述：

In an election, the i-th vote was cast for persons[i] at time times[i].

Now, we would like to implement the following query function: TopVotedCandidate.q(int t) will return the number of the person that was leading the election at time t.  

Votes cast at time t will count towards our query.  In the case of a tie, the most recent vote (among tied candidates) wins.

Example 1:

Input: ["TopVotedCandidate","q","q","q","q","q","q"], [[[0,1,1,0,0,1,0],[0,5,10,15,20,25,30]],[3],[12],[25],[15],[24],[8]]

Output: [null,0,1,1,0,0,1]

Explanation: 

At time 3, the votes are [0], and 0 is leading.

At time 12, the votes are [0,1,1], and 1 is leading.

At time 25, the votes are [0,1,1,0,0,1], and 1 is leading (as ties go to the most recent vote.)

This continues for 3 more queries at time 15, 24, and 8.

Note:

1. 1 <= persons.length = times.length <= 5000

2. 0 <= persons[i] <= persons.length

3. times is a strictly increasing array with all elements in [0, 10^9].

4. TopVotedCandidate.q is called at most 10000 times per test case.

5. TopVotedCandidate.q(int t) is always called with t >= times[0].

class TopVotedCandidate {
public:
    TopVotedCandidate(vector<int> persons, vector<int> times) {
        int max_count=0; // 当前最大票数
        int candidate=0; // 当前top candidate
        for(int i=0;i<times.size();i++)
        {
            if(hash.count(persons[i])==0) hash[persons[i]]=1;
            else hash[persons[i]]++;
            if(max_count<=hash[persons[i]]) 
            {
                v.push_back({times[i],persons[i]});
                candidate=persons[i];
                max_count=hash[persons[i]];
            }
            else v.push_back({times[i],candidate});
        }
    }
    
    int q(int t) {
        pair<int,int> p={t,0};
        auto it=lower_bound(v.begin(),v.end(),p);
        // lower_bound可能恰好等于搜索值，或者小于搜索值
        if(t==it->first) return it->second;
        else return prev(it)->second;
    }
    
private:
    unordered_map<int,int> hash; // 统计每个人对应的票数
    // 因为是按照times[i]的顺序加入{times[i],candidate}，所以已经按照time排好序了
    vector<pair<int,int>> v; // 记录每个时间段(times[i])对应的topCandidate
};