Package g0101_0200.s0136_single_number

Class Solution

java.lang.Object

g0101_0200.s0136_single_number.Solution

public class Solution
extends Object

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:** * 1 <= nums.length <= 3 * 104 * -3 * 104 <= nums[i] <= 3 * 104 * Each element in the array appears twice except for one element which appears only once.

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	singleNumber(int[] nums)

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

singleNumber

public int singleNumber(int[] nums)