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.<p>Easy</p> <p>Given a <strong>non-empty</strong> array of integers <code>nums</code>, every element appears <em>twice</em> except for one. Find that single one.</p> <p>You must implement a solution with a linear runtime complexity and use only constant extra space.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [2,2,1]</p> <p><strong>Output:</strong> 1</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [4,1,2,1,2]</p> <p><strong>Output:</strong> 4</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> nums = [1]</p> <p><strong>Output:</strong> 1</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 3 * 10⁴</code></li> <li><code>-3 * 10⁴ <= nums[i] <= 3 * 10⁴</code></li> <li>Each element in the array appears twice except for one element which appears only once.</li> </ul>

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)