LeetCode-in-Scala.github.io

169. Majority Element

Easy

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 * 104
• -231 <= nums[i] <= 231 - 1

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

Solution

object Solution {
    def majorityElement(nums: Array[Int]): Int = {
        var count = 1
        var majority = nums(0)

        // For Potential Majority Element
        for (i <- 1 until nums.length) {
            if (nums(i) == majority) {
                count += 1
            } else {
                if (count > 1) {
                    count -= 1
                } else {
                    majority = nums(i)
                }
            }
        }

        // For Confirmation
        count = 0
        for (j <- nums) {
            if (j == majority) {
                count += 1
            }
        }

        if (count >= (nums.length / 2) + 1) {
            majority
        } else {
            -1
        }
    }
}

This site is open source. Improve this page.