首页 > 其他 > 详细

leetcode--Single Number

时间:2014-02-25 22:34:53      阅读:422      评论:0      收藏: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?

 

Have you been asked this question in an interview? 

1
2
3
4
5
6
7
8
public class Solution {
    public int singleNumber(int[] A) {
        int once = 0, len = A.length;
        for(int i = 0; i < len; ++i)
            once ^= A[i];
        return once;
    }
}

  

leetcode--Single Number

原文:http://www.cnblogs.com/averillzheng/p/3566416.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!