g0101_0200.s0136_single_number.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.41

package g0101_0200.s0136_single_number;

// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation
// #Data_Structure_II_Day_1_Array #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers
// #Big_O_Time_O(N)_Space_O(1) #2022_06_24_Time_1_ms_(99.97%)_Space_50.9_MB_(35.58%)

/**
 * 136 - Single Number\.
 *
 * Easy
 *
 * Given a **non-empty** array of integers `nums`, every element appears _twice_ except for one. Find that single one.
 *
 * You must implement a solution with a linear runtime complexity and use only constant extra space.
 *
 * **Example 1:**
 *
 * **Input:** nums = [2,2,1]
 *
 * **Output:** 1 
 *
 * **Example 2:**
 *
 * **Input:** nums = [4,1,2,1,2]
 *
 * **Output:** 4 
 *
 * **Example 3:**
 *
 * **Input:** nums = [1]
 *
 * **Output:** 1 
 *
 * **Constraints:**
 *
 * *   1 <= nums.length <= 3 * 10⁴
 * *   -3 * 10⁴ <= nums[i] <= 3 * 10⁴
 * *   Each element in the array appears twice except for one element which appears only once.
**/
public class Solution {
    public int singleNumber(int[] nums) {
        int res = 0;
        for (int num : nums) {
            res ^= num;
        }
        return res;
    }
}