Leetcode136-singleNumber

Posted on 2020-03-02 Edited on 2020-07-06 In leetcode Views: Valine:

Solution Report of LeetCode Acceptted

Description

Given a non-empty 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?

Example

Example 1:

1 2	Input: [2,2,1] Output: 1

Example 2:

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

Solution

class Solution {
    public int singleNumber(int[] nums) {
        int res = 0;
        for (int num: nums) res = res ^ num;
        return res;
    }
}