第一题 Single Number

amberFeb

于 2014-10-06 05:47:02 发布

阅读量316

点赞数

分类专栏： CodeReview

本文链接：https://blog.csdn.net/amberFeb/article/details/39824079

版权

CodeReview 专栏收录该内容

76 篇文章 0 订阅

订阅专栏

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?

Solution in Java:

public class Solution {

    public int singleNumber(int[] A) {

        int num=0;

        for(int i=0; i<A.length; i++){

            num = num^A[i];

        }

        return num;

    }

}

Note: ^是按位异或符号，遵守交换律和结合律，0与任何数异或结果均为该数。注意复习逻辑运算符。

参考资料：http://help.topcoder.com/data-science/competing-in-algorithm-challenges/algorithm-tutorials/a-bit-of-fun-fun-with-bits/