Package g0201_0300.s0229_majority_element_ii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    229 - Majority Element II\.

    Medium

    Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.

    Example 1:

    Input: nums = 3,2,3

    Output: 3

    Example 2:

    Input: nums = 1

    Output: 1

    Example 3:

    Input: nums = 1,2

    Output: 1,2

    Constraints:

    • <code>1 <= nums.length <= 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 List<Integer> majorityElement(IntArray nums)

      • Methods inherited from class java.lang.Object

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