首页 > itarticle > [leetcode] problem 136 – single number

[leetcode] problem 136 – single number

admin 11月 13, 2020 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?

Input: [2,2,1]

Output: 1

Input: [4,1,2,1,2]

Output: 4

public int (int[] nums) {
    int num = 0;

    for (int n : nums)
        num ^= n;

    return num;
}