Skip to content

Commit f388781

Browse files
0xmountaintop0xmountaintop
authored
add Single Number III (#12)
* init single-number-iii * update * init * init sol for single_number_iii * foreach * add more * init sol2 * add * clean * clean
1 parent b6a1d4c commit f388781

File tree

5 files changed

+89
-9
lines changed

5 files changed

+89
-9
lines changed

‎README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -54,10 +54,10 @@ cargo test
5454
0191 |[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/number-of-1-bits.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/number-of-1-bits.py) <br> [Rust](./kamyu104/src/number_of_1_bits.rs) | _O(1)_ | _O(1)_ | Easy |||
5555
0201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/bitwise-and-of-numbers-range.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/bitwise-and-of-numbers-range.py) <br> [Rust](./kamyu104/src/bitwise_and_of_numbers_range.rs) | _O(1)_ | _O(1)_ | Medium ||
5656
0231 | [Power of Two](https://leetcode.com/problems/power-of-two/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/power-of-two.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/power-of-two.py) <br> [Rust](./kamyu104/src/power_of_two.rs) | _O(1)_ | _O(1)_ | Easy | LintCode |
57+
0260 | [Single Number III](https://leetcode.com/problems/single-number-iii/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/single-number-iii.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/single-number-iii.py) <br> [Rust](./kamyu104/src/single_number_iii.rs) | _O(n)_ | _O(1)_ | Medium ||
5758

5859
kamyu104/src/main.rs
Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -4,4 +4,5 @@ mod power_of_two;
44
mod reverse_bits;
55
mod single_number;
66
mod single_number_ii;
7+
mod single_number_iii;
78
mod template;

‎kamyu104/src/power_of_two.rs

Lines changed: 0 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -15,10 +15,8 @@ impl Solution2 {
1515
}
1616
}
1717

18-
1918
#[cfg(test)]
2019
mod tests {
21-
// Note this useful idiom: importing names from outer (for mod tests) scope.
2220
use super::*;
2321

2422
#[test]
@@ -32,4 +30,3 @@ mod tests {
3230
assert_eq!(Solution2::is_power_of_two(218), false);
3331
}
3432
}
35-

‎kamyu104/src/reverse_bits.rs

Lines changed: 31 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,24 @@
11
// Time : O(logn) = O(32)
22
// Space: O(1)
33

4-
pub struct Solution {}
5-
impl Solution {
4+
pub struct Solution1 {}
5+
impl Solution1 {
66
pub fn reverse_bits(mut n: u32) -> u32 {
77
let mut result: u32 = 0;
8-
for _ in (0..32) {
8+
(0..32).for_each(|_| {
9+
result <<= 1;
10+
result |= n & 1;
11+
n >>= 1;
12+
});
13+
result
14+
}
15+
}
16+
17+
pub struct Solution2 {}
18+
impl Solution2 {
19+
pub fn reverse_bits(mut n: u32) -> u32 {
20+
let mut result: u32 = 0;
21+
for _ in 0..32 {
922
result <<= 1;
1023
result |= n & 1;
1124
n >>= 1;
@@ -21,13 +34,26 @@ mod tests {
2134
#[test]
2235
fn test_reverse_bits() {
2336
assert_eq!(
24-
Solution::reverse_bits(
37+
Solution1::reverse_bits(
38+
u32::from_str_radix("00000010100101000001111010011100", 2).unwrap()
39+
),
40+
u32::from_str_radix("00111001011110000010100101000000", 2).unwrap()
41+
);
42+
assert_eq!(
43+
Solution1::reverse_bits(
44+
u32::from_str_radix("11111111111111111111111111111101", 2).unwrap()
45+
),
46+
u32::from_str_radix("10111111111111111111111111111111", 2).unwrap()
47+
);
48+
49+
assert_eq!(
50+
Solution2::reverse_bits(
2551
u32::from_str_radix("00000010100101000001111010011100", 2).unwrap()
2652
),
2753
u32::from_str_radix("00111001011110000010100101000000", 2).unwrap()
2854
);
2955
assert_eq!(
30-
Solution::reverse_bits(
56+
Solution2::reverse_bits(
3157
u32::from_str_radix("11111111111111111111111111111101", 2).unwrap()
3258
),
3359
u32::from_str_radix("10111111111111111111111111111111", 2).unwrap()

‎kamyu104/src/single_number_iii.rs

Lines changed: 56 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,56 @@
1+
// Time: O(n)
2+
// Space: O(1)
3+
4+
pub struct Solution1 {}
5+
impl Solution1 {
6+
pub fn single_number(nums: Vec<i32>) -> Vec<i32> {
7+
// Xor all the elements to get x ^ y.
8+
let x_xor_y: i32 = nums.iter().fold(0, |acc, &num| acc ^ num);
9+
10+
// Get the last bit where 1 occurs by "x & ~(x - 1)"
11+
// Because -(x - 1) = ~(x - 1) + 1 <=> -x = ~(x - 1)
12+
// So we can also get the last bit where 1 occurs by "x & -x"
13+
let bit: i32 = x_xor_y & -x_xor_y;
14+
let mut result = vec![0; 2];
15+
nums.iter()
16+
.for_each(|i| result[((i & bit) != 0) as usize] ^= i);
17+
result
18+
}
19+
}
20+
21+
pub struct Solution2 {}
22+
impl Solution2 {
23+
pub fn single_number(nums: Vec<i32>) -> Vec<i32> {
24+
// Xor all the elements to get x ^ y.
25+
let mut x_xor_y: i32 = 0;
26+
for i in nums.iter() {
27+
x_xor_y ^= i;
28+
}
29+
30+
// Get the last bit where 1 occurs.
31+
let bit: i32 = x_xor_y & -x_xor_y;
32+
33+
// Get the subset of A where the number has the bit.
34+
// The subset only contains one of the two integers, call it x.
35+
// Xor all the elements in the subset to get x.
36+
let mut x: i32 = 0;
37+
nums.iter().for_each(|i| {
38+
if i & bit != 0 {
39+
x ^= i;
40+
}
41+
});
42+
vec![x, x_xor_y ^ x]
43+
}
44+
}
45+
46+
#[cfg(test)]
47+
mod tests {
48+
use super::*;
49+
50+
#[test]
51+
fn test_single_number() {
52+
assert_eq!(Solution1::single_number(vec![1, 2, 1, 3, 2, 5]), vec![5, 3]);
53+
54+
assert_eq!(Solution2::single_number(vec![1, 2, 1, 3, 2, 5]), vec![3, 5]);
55+
}
56+
}

0 commit comments

Comments
 (0)