Package g0101_0200.s0136_single_number

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    136 - Single Number\.

    Easy

    Given a non-empty array of integers nums, every element appears twice except for one. Find that single one.

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

    Example 1:

    Input: nums = 2,2,1

    Output: 1

    Example 2:

    Input: nums = 4,1,2,1,2

    Output: 4

    Example 3:

    Input: nums = 1

    Output: 1

    Constraints:

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

    • <code>-3 * 10<sup>4</sup><= numsi<= 3 * 10<sup>4</sup></code>

    • Each element in the array appears twice except for one element which appears only 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