leetcode.136.Single Number

leetcode.136.Single Number

Description

Given an array of integers, every element appears twice except for one. Find that single one.

Requirement

Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?

Hint

要在线性时间复杂度内完成此要求，可利用二进制数的异或操作
异或操作常用于判断两个数是否相等

Result

class Solution {public:    int singleNumber(vector<int>& nums) {        int result = 0;        for (vector<int>::iterator it = nums.begin(); it != nums.end(); ++it) {            result = result ^ (*it);        }        return result;    }};