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:
<li><code>1 <= persons.length = times.length <= 5000</code></li>
<li><code>0 <= persons[i] <= persons.length</code></li>
<li><code>times</code> is a strictly increasing array with all elements in <code>[0, 10^9]</code>.</li>
<li><code>TopVotedCandidate.q</code> is called at most <code>10000</code> times per test case.</li>
<li><code>TopVotedCandidate.q(int t)</code> is always called with <code>t >= times[0]</code>.</li>