Single Number

最新推荐文章于 2020-10-26 17:50:47 发布

一万小时

最新推荐文章于 2020-10-26 17:50:47 发布

阅读量292

点赞数

分类专栏： leetcode 文章标签： leetcode java

本文链接：https://blog.csdn.net/u013546587/article/details/42088353

版权

leetcode 专栏收录该内容

15 篇文章 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?

异或，很简单

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
package Reverse;

/**
 *
 * @author suisuihan
 */
public class GetSingleNumber {
    public int singleNumber(int[] A) {
        int length = A.length;
        if (length == 0) {
            return 0;
        } 
        int ret = 0;
        for (int i = 0; i < length; i++) {
            ret = ret ^ A[i];
        }
        return ret;
    }
    public static void main(String[] args) {
        GetSingleNumber test = new GetSingleNumber();
        int[] A = {3,1,1};
        System.out.println(test.singleNumber(A));
    }
}