LeetCode(2), Single Number, 只出现一次的数字

Single Number

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

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

Example 2:

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

Solution

1. HashMap

Time complexity: O(n+n) = O(n)
Space complexity: O(n)

class Solution {
    public int singleNumber(int[] nums) {
        HashMap<Integer, Integer> hashMap = new HashMap<>();

        for (int i = 0; i < nums.length; i++) {
            hashMap.put(nums[i], hashMap.getOrDefault(nums[i], 0) + 1);
        }
        
        for (int i = 0; i < nums.length; i++) {
            if (hashMap.get(nums[i]) == 1) {
                return nums[i];
            }
        }
        return 0;
    }
}

2. XOR

非常巧妙的方法，一个数与0做XOR操作后，结果不变，一个数与本身做XOR操作后，结果为0。又因为XOR满足交换律，所以将所有的数累计XOR操作后，得到的结果即为只出现一次的数字， 因为出现了两次的数字与自身相乘后等于0。

• XOR is communitive
• a ^ 0 = a
• a ^ a = 0
• Time complexity: O(n)
• Space complexity: O(1)

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