leetcode

0 class Solution {

1 public:

2 char findKthBit(int n, int k) const {

3 int flip = 0, l = (1 << n) - 1;

4 while (k > 1) {

5 if (k == l / 2 + 1) return '1' - flip;

6 if (k > l / 2) {

7 k = l + 1 - k;

8 flip = !flip;

9 }

10 l /= 2;

11 }

12 return '0' + flip;

13 }

14 };