LeetCode每日一题(911. Online Election)

You are given two integer arrays persons and times. In an election, the ith vote was cast for persons[i] at time times[i].

For each query at a time t, find 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.

Implement the TopVotedCandidate class:

TopVotedCandidate(int[] persons, int[] times) Initializes the object with the persons and times arrays.
int q(int t) Returns the number of the person that was leading the election at time t according to the mentioned rules.

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
TopVotedCandidate topVotedCandidate = new TopVotedCandidate([0, 1, 1, 0, 0, 1, 0], [0, 5, 10, 15, 20, 25, 30]);
topVotedCandidate.q(3); // return 0, At time 3, the votes are [0], and 0 is leading.
topVotedCandidate.q(12); // return 1, At time 12, the votes are [0,1,1], and 1 is leading.
topVotedCandidate.q(25); // return 1, At time 25, the votes are [0,1,1,0,0,1], and 1 is leading (as ties go to the most recent vote.)
topVotedCandidate.q(15); // return 0
topVotedCandidate.q(24); // return 0
topVotedCandidate.q(8); // return 1

Constraints:

• 1 <= persons.length <= 5000
• times.length == persons.length
• 0 <= persons[i] < persons.length
• 0 <= times[i] <= 109
• times is sorted in a strictly increasing order.
• times[0] <= t <= 109
• At most 104 calls will be made to q.

---

通过记录每个人在每个时间点上获取的票的数量和一个当前最大得票量， 我们可以轻易的得到一个在每个时间点上的得票最多的人， 剩下的就是根据时间 t 进行二分搜索了

---

use std::collections::HashMap;
struct TopVotedCandidate {
    times: Vec<i32>,
    leaders: Vec<i32>,
}

impl TopVotedCandidate {
    fn new(persons: Vec<i32>, times: Vec<i32>) -> Self {
        let mut m = HashMap::new();
        let mut max = 0;
        let mut leader = 0;
        let mut leaders = Vec::new();
        for &p in &persons {
            *m.entry(p).or_insert(0) += 1;
            let v = *m.get(&p).unwrap();
            if v >= max {
                max = v;
                leader = p;
            }
            leaders.push(leader)
        }
        Self { times, leaders }
    }

    fn q(&self, t: i32) -> i32 {
        let mut low = 0usize;
        let mut high = self.times.len() - 1;
        while low < high {
            let mid = (low + high) / 2;
            if self.times[mid] < t {
                low = mid + 1;
            } else {
                high = mid;
            }
        }
        if self.times[low] > t {
            return self.leaders[low - 1];
        }
        self.leaders[low]
    }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42