id 1398669238 Time: 3 ms MemUsage: 2.4 MB
This commit is contained in:
18
leetcode/majority-element/solution_1398669238.rs
Normal file
18
leetcode/majority-element/solution_1398669238.rs
Normal file
@@ -0,0 +1,18 @@
|
||||
// Boyer–Moore majority vote algorithm
|
||||
|
||||
impl Solution {
|
||||
pub fn majority_element(nums: Vec<i32>) -> i32 {
|
||||
let (mut maj, mut count) = (0, 0);
|
||||
for &x in &nums{
|
||||
if count == 0 {
|
||||
maj = x;
|
||||
count = 1;
|
||||
} else if maj == x {
|
||||
count += 1;
|
||||
} else {
|
||||
count -= 1;
|
||||
}
|
||||
}
|
||||
maj
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user