# Single Number and Single Number II

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

[2] Given an array of integers, every element appears three times except for one. Find that single one. (better solution is needed)

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

int SingleNumber(int arr[] , int length)
{
int i , xor;
for(xor = 0 , i = 0 ; i < length ; ++i)
xor = xor ^ arr[i];

return xor;
}

 1 #include<iostream>
2 using namespace std;
3
4 int SingleNumber(int arr[] , int length)
5 {
6     int i , xor;
7     for(xor = 0 , i = 0 ; i < length ; ++i)
8         xor = xor ^ arr[i];
9
10     return xor;
11 }
12
13 int main()
14 {
15     int arr[] = {2 , 1 , 2 , 1 , 3 , 4 , 3};
16     int length = sizeof(arr)/ sizeof(int);
17
18     cout<<SingleNumber(arr , length)<<endl;
19
20     return 0;
21
22
23 }

|
5月前
|

Leetcode Single Number II （面试题推荐）

21 0
|

LeetCode 136. 只出现一次的数字 Single Number
LeetCode 136. 只出现一次的数字 Single Number
47 0
|

LeetCode 260. Single Number III

73 0
|
PHP
Leetcode 之 PHP 解析 (260. Single Number III)
Leetcode 之 PHP 解析 (260. Single Number III)
79 0
|

Leetcode-Easy 136. Single Number
Leetcode-Easy 136. Single Number
94 0
LeetCode 136：只出现一次的数字 Single Number

952 0
LeetCode 260 Single Number III（只出现一次的数字 III）（*）

1221 0
|

LeetCode 136 Single Number（只出现一次的数字）

983 0
|

LeetCode 137 Single Number II（只出现一次的数字 II）（*）

1483 0
Single Number and Single Number II
[1] Given an array of integers, every element appears twice except for one. Find that single one.
741 0