Package g0101_0200.s0137_single_number_ii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    137 - Single Number II\.

    Medium

    Given an integer array nums where every element appears three times except for one, which appears exactly once. Find the single element and return it.

    You must implement a solution with a linear runtime complexity and use only constant extra space.

    Example 1:

    Input: nums = 2,2,3,2

    Output: 3

    Example 2:

    Input: nums = 0,1,0,1,0,1,99

    Output: 99

    Constraints:

    • <code>1 <= nums.length <= 3 * 10<sup>4</sup></code>

    • <code>-2<sup>31</sup><= numsi<= 2<sup>31</sup> - 1</code>

    • Each element in nums appears exactly three times except for one element which appears once.

    • 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 singleNumber(IntArray nums)

      • Methods inherited from class java.lang.Object

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