Skip to content

Commit b3afdb1

Browse files
authored
Create 0869_reordered_power_of_2.rs
1 parent 6f2073e commit b3afdb1

File tree

1 file changed

+21
-0
lines changed

1 file changed

+21
-0
lines changed
Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
use std::collections::HashSet;
2+
3+
impl Solution {
4+
pub fn reordered_power_of2(n: i32) -> bool {
5+
fn extract_digits(mut number: i32) -> [u8; 10] {
6+
let mut digits = [0; 10];
7+
while number > 0 {
8+
digits[number as usize % 10] += 1;
9+
number /= 10;
10+
}
11+
digits
12+
}
13+
let mut set = HashSet::new();
14+
let mut curr = 1;
15+
for i in 0..30 {
16+
set.insert(extract_digits(curr));
17+
curr = curr << 1;
18+
}
19+
set.contains(&extract_digits(n))
20+
}
21+
}

0 commit comments

Comments
 (0)