zoukankan      html  css  js  c++  java
  • K-th Symbol in Grammar

    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



    The whole structure can be viewed a binary tree, when a node is 0, their two children nodes are 0 and 1,
    similarly, when a node is 1, two children nodes are 1 and 0.
    We can know whether the position of K is a left node or a right node by dividing 2.
    If K is even, current node is right child, and its parent is the (K/2)th node in previous row;
    else if K is odd, current node is left child and its parent is the ((K+1)/2)th node in previous row.
    The value of current node depends on its parent node, without knowing its parent node value,
    we still cannot determine current node value.
    That's why we need recursion, we keep going previous row to find the parent node until reach the first row.
    Then all the parent node value will be determined after the recursion function returns.

    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;
        }
    };
    
    
    
     
  • 相关阅读:
    常用 JS代码
    java中的变量各占得字节数
    70种简单好用的js代码
    JavaScript window.document的属性、方法和事件小结
    JS的event对象使用总结
    PHP魔术函数执行时间和顺序解析
    javascript event详解
    JS获取鼠标点击对象
    ThinkPHP实例化模型的四种方法
    实践:服务器编写/系统架构/cache
  • 原文地址:https://www.cnblogs.com/250101249-sxy/p/11494395.html
Copyright © 2011-2022 走看看