Skip to content
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
22 changes: 22 additions & 0 deletions problems/136.single-number.md
Original file line number Diff line number Diff line change
Expand Up @@ -36,6 +36,9 @@ Your algorithm should have a linear runtime complexity. Could you implement it w

## 代码

* 语言支持:JS,C++

JavaScrip Code:
```js
/*
* @lc app=leetcode id=136 lang=javascript
Expand Down Expand Up @@ -86,6 +89,25 @@ var singleNumber = function(nums) {
return ret;
};
```
C++:
```C++
class Solution {
public:
int singleNumber(vector<int>& nums) {
auto ret = 0;
for (auto i : nums) ret ^= i;
return ret;
}
};

// C++ one-liner
class Solution {
public:
int singleNumber(vector<int>& nums) {
return accumulate(nums.cbegin(), nums.cend(), 0, bit_xor<int>());
}
};
```

## 延伸

Expand Down