Single Number

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

淡淡的一抹

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

阅读量265

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/ych4513979/article/details/42142287

版权

LeetCode 专栏收录该内容

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

1 自己的代码

import java.util.Arrays;


public class SingleNumber {
	public int singleNumber(int[] A) {
		Arrays.sort(A);
		int result = A[0];
		for(int i = 0; i < A.length; i = i + 2){
			if(i == A.length - 1){
				result = A[i];
				break;
			}
			if(A[i] == A[i+1]) continue;
			else{
				result = A[i];
				break;
			}
		}
		return result;
	}
}