Package g0101_0200.s0169_majority_element

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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

    • <code>1 <= n <= 5 * 10<sup>4</sup></code>

    • <code>-10<sup>9</sup><= numsi<= 10<sup>9</sup></code>

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

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer majorityElement(IntArray arr)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait