Sponsored
Sponsored
This approach leverages the properties of XOR bitwise operation. The XOR of a number with itself is 0, and the XOR of a number with 0 is the number itself. Thus, XORing all elements in the array results in getting the single number because all other numbers cancel themselves out.
Time Complexity: O(n) - We go through the array once.
Space Complexity: O(1) - We only use a single integer to store the result.
1public class SingleNumber {
2 public static int singleNumber(int[] nums) {
3 int result = 0;
4 for (int num : nums) {
5 result ^= num;
6 }
7 return result;
8 }
9
10 public static void main(String[] args) {
11 int[] nums = {2, 2, 1};
12 System.out.println(singleNumber(nums)); // Output: 1
13 }
14}This Java solution uses a similar approach where it iterates over the array performing the XOR operation, ultimately leaving the single non-duplicate number.
In this approach, we use a hash map (or dictionary) to count occurrences of each number. The single number will have a count of 1. This isn't the optimal solution in terms of extra space but is valid if space was not constrained.
Time Complexity: O(n) - We traverse the array twice (once for filling the map, once for checking the counts).
Space Complexity: O(n) - Extra space proportional to the input range.
1#
This C solution uses an array to simulate a hash map, where each index corresponds to a potential value of nums[i]. It maps numbers from -30000 to +30000 to indices 0 to 60000 to handle negative numbers.