0169 Majority Element · cho.sh

0169 Majority Element

Warning

This post is more than a year old. Information may be outdated.

Solved at: 230128

Question

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.

Solution

Backlinks1

Coding Tests

Comments0

No comments yet. Be the first to share your thoughts.

Comments

swift

class Solution {
    func majorityElement(_ nums: [Int]) -> Int {
        var count : Int = 0
        var candidate: Int? = nil

        for num in nums {
            if count == 0 {
                candidate = num
            }
            if candidate == num {
                count += 1
            } else {
                count -= 1
            }
        }
        return candidate!
    }
}

0169 Majority Element

Question

Solution

Results

Complexity Analysis

Improved

Boyer-Moore Voting Algorithm