---
tags: leetcode
---

# [136. Single Number](https://leetcode.com/problems/single-number/)
---
# My Solution
## The Key Idea for Solving This Coding Question
## C++ Code

class Solution {
public:
    int singleNumber(vector<int> &nums) {
        int single = 0;

        for (int i = 0; i < nums.size(); ++i) {
            single ^= nums[i];
        }
        return single;
    }
};

## Time Complexity
$O(n)$
$n$ is the length of `nums`.
## Space Complexity
$O(1)$
# Miscellaneous
<!--
# Test Cases

[2,2,1]

[4,1,2,1,2]

[1]

-->