leetcode(十六)Single Number

最新推荐文章于 2020-08-06 19:11:52 发布

urgemule

最新推荐文章于 2020-08-06 19:11:52 发布

阅读量596

点赞数

分类专栏： java 文章标签： leetcode algorithm 排序算法

本文链接：https://blog.csdn.net/u011559205/article/details/38091397

版权

java 专栏收录该内容

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

public class Solution {
    public int singleNumber(int[] A) {
		Arrays.sort(A);//can't access linear
		//A.length must be odd
        for(int i=0;i < A.length-1;i+=2){
			if(A[i] != A[i+1])
				return A[i];
		}
	//that's last element	
	return A[A.length-1];
    }
}

Runtime: 436 ms

上述算法可能并非线性(有排序算法)，但能通过验证???

不知，有无不排序找到single number的算法