Description
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 <= persons.length = times.length <= 5000
- 0 <= persons[i] <= persons.length
- times is a strictly increasing array with all elements in [0, 10^9].
- TopVotedCandidate.q is called at most 10000 times per test case.
- TopVotedCandidate.q(int t) is always called with t >= times[0].
分析
题目的意思是:给定不同时间点的候选人,实现q函数,即根据t返回当前的票数最多的候选人。这道题可以把每个时间点的的票数最多的人先算出来,代码里是leads,然后根据时刻t二分查找找到相应时刻对应的候选人就行了。
代码
class TopVotedCandidate:
def __init__(self, persons: List[int], times: List[int]):
self.leads=[]
self.times=times
self.d=collections.defaultdict(int)
idx=-1
for person in persons:
self.d[person]+=1
if(self.d[idx]<=self.d[person]):
idx=person
self.leads.append(idx)
print(self.leads)
def q(self, t: int) -> int:
l=0
h=len(self.times)-1
while(l<=h):
mid=l+(h-l)//2
if(self.times[mid]==t):
return self.leads[mid]
elif(self.times[mid]>t):
h=mid-1
else:
l=mid+1
return self.leads[l-1]
# Your TopVotedCandidate object will be instantiated and called as such:
# obj = TopVotedCandidate(persons, times)
# param_1 = obj.q(t)