We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent c6c339a commit d26c0deCopy full SHA for d26c0de
scripts/algorithms/F/Find Kth Bit in Nth Binary String/Find Kth Bit in Nth Binary String.rs
@@ -0,0 +1,29 @@
1
+// Runtime: 40 ms (Top 50.0%) | Memory: 4.04 MB (Top 100.0%)
2
+
3
+impl Solution {
4
+ pub fn find_kth_bit(n: i32, k: i32) -> char {
5
+ let n = n as usize;
6
+ let k = k as usize;
7
+ let mut arr = vec![vec![]; n];
8
9
+ arr[0].push(false);
10
+ for i in 1..n {
11
+ let len = arr[i - 1].len();
12
+ for j in 0..len {
13
+ let v = arr[i - 1][j];
14
+ arr[i].push(v);
15
+ }
16
+ arr[i].push(true);
17
+ for j in (0..len).rev() {
18
+ let v = !arr[i - 1][j];
19
20
21
22
23
+ if arr[n - 1][k - 1] {
24
+ '1'
25
+ } else {
26
+ '0'
27
28
29
+}
0 commit comments