260. Single Number III

#php #leetcode #algorithms #programming

Medium

Given an integer array nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once. You can return the answer in any order.

You must write an algorithm that runs in linear runtime complexity and uses only constant extra space.

Example 1:

Input: nums = [1,2,1,3,2,5]
Output: [3,5]
Explanation: [5, 3] is also a valid answer.

Example 2:

Input: nums = [-1,0]
Output: [-1,0]

Example 3:

Input: nums = [0,1]
Output: [1,0]

Constraints:

2 <= nums.length <= 3 * 10⁴
-2³¹ <= nums[i] <= 2³¹ - 1
Each integer in nums will appear twice, only two integers will appear once.

Solution:

class Solution {

    /**
     * @param Integer[] $nums
     * @return Integer[]
     */
    function singleNumber($nums) {
        $xors = array_reduce($nums, function($carry, $item) { return $carry ^ $item; }, 0);
        $lowbit = $xors & -$xors;
        $ans = array_fill(0, 2, 0);

        foreach ($nums as $num) {
            if ($num & $lowbit) {
                $ans[0] ^= $num;
            } else {
                $ans[1] ^= $num;
            }
        }

        return $ans;

    }
}

Contact Links

If you found this series helpful, please consider giving the repository a star on GitHub or sharing the post on your favorite social networks 😍. Your support would mean a lot to me!

If you want more helpful content like this, feel free to follow me: