LeetCode - Single Number

batilei

于 2014-01-12 11:50:27 发布

阅读量944

点赞数

CC 4.0 BY-SA版权

分类专栏： Algorithm

本文链接：https://blog.youkuaiyun.com/tspatial_thunder/article/details/18180645

Algorithm 专栏收录该内容

78 篇文章

订阅专栏

本文介绍了一种通过XOR操作解决数组中出现两次的元素问题的方法，阐述了该算法的原理和实现过程，使得在面对此类问题时能够快速找到解决方案。

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

The kind of problem when you have no idea, it is very difficult. But once you know how to make it, it is very simple. Just use the XOR operation and go over the array. The numbers show up twice will disappear eventually.

public class Solution {
    public int singleNumber(int[] A) {
        int ans = A[0];
        
        for(int i=1;i<A.length;i++)
        {
        	ans ^= A[i];
        }
        
        return ans;
    }
}