meta data for this page
  •  

Single Number

Leetcode

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

Solution 1

Solution 1

public int singleNumber(int[] nums) {
  int i = 0;
  while (i < nums.length - 1) {
    nums[i + 1] = nums[i] ^ nums[++i];
  }
  return nums[nums.length - 1];
}