leetcode--Single Number

原创于 2015-06-19 14:46:11 发布 · 687 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

177 篇文章

订阅专栏

本文介绍了一种线性时间复杂度的算法来找出数组中只出现一次的元素，该算法不使用额外内存，通过位操作实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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[] nums) {
        int res = 0;
		for(int i=0;i<nums.length;i++){
			res ^= nums[i];
		}
		return res;
    }
}