Bitwise Operation(LC.136,137,260)
136. Single Number
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 = ...
hikaru.hashnode.dev5 min read