Package g0101_0200.s0169_majority_element

Class Solution

java.lang.Object
g0101_0200.s0169_majority_element.Solution
public class Solution extends java.lang.Object
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 \u230an / 2\u230b 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?

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    int
    majorityElement(int[] arr)
     

    Methods inherited from class java.lang.Object

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

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • majorityElement

      public int majorityElement(int[] arr)