[LeetCode]136. Single Number 异或用来找不同真方便啊……

题目:

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& nums) {
        for(int i = 1; i

你可能感兴趣的:([LeetCode]136. Single Number 异或用来找不同真方便啊……)