Rust Algorithm: Single Number
136. Single Number Introduction Given a non-empty integer array nums, where every element appears twice except for one, find that single element. You must design and implement an algorithm with linear time complexity that uses only constant extra space. Example 1: Input: nums = [2,2,1] Output: 1 Example 2: Input: nums = [4,1,2,1,2] Output: 4 … Read more