169. Majority Element

Problem Statement

Given an array nums of size n, return the majority element.

The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.

Example 1:

Input: nums = [3,2,3]
Output: 3

Example 2:

Input: nums = [2,2,1,1,1,2,2]
Output: 2

Constraints:

n == nums.length
1 <= n <= 5 * 10⁴
-10⁹ <= nums[i] <= 10⁹

Follow-up: Could you solve the problem in linear time and in O(1) space?

Solution:

Rust

impl Solution {
    pub fn majority_element(nums: Vec<i32>) -> i32 {
        let (mut element, mut count) = (nums[0], 0);

        for num in nums {
            if count == 0 {
                element = num;
            }

            if element == num {
                count += 1;
            } else {
                count -= 1;
            }
        }

        element
    }
}

169. Majority Element #

Problem Statement #

Solution: #

... #

169. Majority Element

Problem Statement

Solution:

...