我的解法

class Solution {
public:
    int singleNumber(vector<int>& nums) {
        for (int i = 1; i < nums.size(); i ++){
            nums[0] ^= nums[i];
        }
        return nums[0];
    }
};

Leetcode PHP题解--D51 136. Single
D51 136. Single Number 题目链接 136. Single Number 题目分析返回给定数...
LeetCode #136 #137 #260 2018-07-
136. Single Number https://leetcode.com/problems/single-n...
Leetcode136-Single Number(Python
136. Single Number Given an array of integers, every elem...
leetcode:136. Single Number
136. Single Number Description Given a non-empty array of...
Leetcode 136 Single Number
题目链接：136. Single Number 题目描述 Given a non-empty array of i...
136. Single Number
Leetcode: 136. Single NumberGiven a non-empty array of in...
136. Single Number
Given a non-empty array of integers, every element appear...
136. Single Number
Problem Given a non-empty array of integers, every elemen...
136. Single Number
问题描述 Given a non-empty array of integers, every element a...
136. Single Number
首先哈希表的做法，时间复杂度够，但是空间肯定不行：思路2：利用异或操作。异或的性质1：交换律a ^ b = b ...