On the first row, we write a 0
. Now in every subsequent row, we look at the previous row and replace each occurrence of 0
with 01
, and each occurrence of 1
with 10
.
Given row N
and index K
, return the K
-th indexed symbol in row N
. (The values of K
are 1-indexed.) (1 indexed).
Examples: Input: N = 1, K = 1 Output: 0 Input: N = 2, K = 1 Output: 0 Input: N = 2, K = 2 Output: 1 Input: N = 4, K = 5 Output: 1 Explanation: row 1: 0 row 2: 01 row 3: 0110 row 4: 01101001
Note:
N
will be an integer in the range[1, 30]
.K
will be an integer in the range[1, 2^(N-1)]
.
题解如下:
整个结构可以看成二叉树,当一个节点为0时,它们的两个子节点为0和1,同理,当一个节点为1时,两个子节点为1和0。我们可以通过除以2知道K的位置是左结点还是右结点。如果K为偶数,则当前节点为右子节点,其父节点为上一行的第(K/2)个节点;否则,如果K是奇数,则当前节点为左子节点,其父节点为上一行中的第((K+1)/2)个节点。
当前节点的值取决于它的父节点,如果不知道它的父节点值,我们仍然不能确定当前节点的值。这就是为什么我们需要递归,我们继续往前一行查找父节点,直到到达第一行。然后在递归函数返回后确定所有的父节点值。
class Solution {
public int kthGrammar(int N, int K) {
if(N == 1)
return 0;
if((K & 1) == 1)//奇数代表当前结点位于左子树
return (kthGrammar(N-1, (K+1)/2) == 0? 0:1);
else
return (kthGrammar(N-1,(K/2)) == 0? 1:0);
}
}