Single Number

最新推荐文章于 2025-09-10 22:21:01 发布

转载最新推荐文章于 2025-09-10 22:21:01 发布 · 52 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：https://juejin.im/post/5ba22739e51d450e7210a172

文章标签：

#java

date: 2018/09/19 原文

1. Question

Given a non-empty array of integers, every element appears twice except for one. Find that single one.

Example 1:

Input: [2,2,1]
Output: 1
复制代码

Example 2:

Input: [4,1,2,1,2]
Output: 4
复制代码

2. Solution

class Solution {
    public int singleNumber(int[] nums) {
        int i = 1;
        int a = nums[0];
        while (i < nums.length) {
            a = a ^ nums[i];  //利用与或的关系
            i++;
        }
        return a;
    }
}
复制代码