码迷,mamicode.com
首页 > 编程语言 > 详细

[LeetCode][JavaScript]Single Number

时间:2015-08-18 01:05:42      阅读:263      评论:0      收藏:0      [点我收藏+]

标签:

Single Number

Given an array of integers, every element appears twice except for one. Find that single one.

Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?

https://leetcode.com/problems/single-number/

 

 


 

 

要求线性复杂度和不能用额外的空间。

异或运算,两个相同的数,异或的结果是0,一直异或最后剩下的就是结果。

 1 /**
 2  * @param {number[]} nums
 3  * @return {number}
 4  */
 5 var singleNumber = function(nums) {
 6     var res = 0;
 7     for(var i = 0; i < nums.length; i++){
 8         res = res ^ nums[i];
 9     }
10     return res;
11 };

 

 

 

[LeetCode][JavaScript]Single Number

标签:

原文地址:http://www.cnblogs.com/Liok3187/p/4738111.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!