[leetcode] 911. Online Election

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. 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].

分析

题目的意思是:给定不同时间点的候选人,实现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)

参考文献

[LeetCode] 【LeetCode】911. Online Election 解题报告(Python

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

农民小飞侠

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值