[LC] 136. Single Number

标签：bsp   cep   appear   find   should   single   res   solution   ext   

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 1:

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

Example 2:

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

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

[LC] 136. Single Number

标签：bsp   cep   appear   find   should   single   res   solution   ext   

原文地址：https://www.cnblogs.com/xuanlu/p/11848021.html