Leetcode 136. Single Number (Medium) (cpp)

Leetcode 136. Single Number (Medium) (cpp)

Tag: Hash Table, Bit Manipulation

Difficulty: Medium

/*136. Single Number (Medium)Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?*/class Solution {public:int singleNumber(vector<int>& nums) {for (int i = 1; i < nums.size(); i++) {nums[0] ^= nums[i];        }return nums[0];}};