Package g0201_0300.s0260_single_number_iii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    260 - Single Number III.

    Medium

    Given an integer array nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once. You can return the answer in any order.

    You must write an algorithm that runs in linear runtime complexity and uses only constant extra space.

    Example 1:

    Input: nums = 1,2,1,3,2,5

    Output: 3,5 **Explanation: ** 5, 3 is also a valid answer.

    Example 2:

    Input: nums = -1,0

    Output: -1,0

    Example 3:

    Input: nums = 0,1

    Output: 1,0

    Constraints:

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

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

    • Each integer in nums will appear twice, only two integers will appear 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 IntArray singleNumber(IntArray nums)

      • Methods inherited from class java.lang.Object

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