LeetCode-136. Single Number

发表于 分类于

问题描述

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
2
Input: nums = [2,2,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.

解答

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
/*
 * @Description: 136. Single Number
 * @Author: libk
 * @Github: https://github.com/libk
 */
/**
 * @param {number[]} nums
 * @return {number}
 */
const singleNumber = function (nums) {
  let result = nums[0]
  for (let i = 1; i < nums.length; i++) {
    result ^= nums[i]
  }
  return result
}