[leetcode] 779. K-th Symbol in Grammar

Description

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:

1. N will be an integer in the range [1, 30].
2. K will be an integer in the range [1, 2^(N-1)].

分析

题目的意思是：求出语法中的第k个符号，N代表行号，K代表列号。

		         0
	       /           \
	      0             1
	   /     \         /   \
	  0        1      1     0
	 /  \     / \     / \  / \
    0   1    1   0   1   00   1

• 找规律，然后递归就是了。

代码

class Solution {
public:
    int kthGrammar(int N, int K) {
        if(N==1) return 0;
        if(K%2==0) return kthGrammar(N-1,K/2)==0 ? 1:0;
        else return kthGrammar(N-1,(K+1)/2)==0 ? 0:1;
    }
};

参考文献

[LeetCode] K-th Symbol in Grammar 语法中的第K个符号