1104. Path In Zigzag Labelled Binary Tree**

最新推荐文章于 2022-09-09 04:42:51 发布

原创最新推荐文章于 2022-09-09 04:42:51 发布 · 500 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#leetcode #算法

LeetCode 专栏收录该内容

416 篇文章

订阅专栏

本文详细解析了LeetCode上编号为1104的问题：在锯齿形标记二叉树中寻找从根节点到指定节点的路径。通过分析无限二叉树的特殊标记方式，提供了一种C++的解决方案，该方案能够有效找到并返回从根节点到特定标记节点的路径。

1104. Path In Zigzag Labelled Binary Tree**

https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/

题目描述

In an infinite binary tree where every node has two children, the nodes are labelled in row order.

In the odd numbered rows (ie., the first, third, fifth,…), the labelling is left to right, while in the even numbered rows (second, fourth, sixth,…), the labelling is right to left.

在这里插入图片描述

Given the label of a node in this tree, return the labels in the path from the root of the tree to the node with that label.

Example 1:

Input: label = 14
Output: [1,3,4,14]

Example 2:

Input: label = 26
Output: [1,2,6,10,26]

Constraints:

1 <= label <= 10^6

C++ 实现 1

解决这道题需要仔细找规律.

在这里插入图片描述

class Solution {
private:
    int get_row(int label) {
        int row = -1;
        while (label) {
            row += 1;
            label /= 2;
        }
        return row;
    }
public:
    vector<int> pathInZigZagTree(int label) {
        int row = get_row(label);
        vector<int> res{label};
        while (row) {
            int N = int(std::pow(2, row + 1)) - 1 + int(std::pow(2, row));
            int cur = res.back();
            int prev = (N - cur) / 2;
            res.push_back(prev);
            row --;
        }
        std::reverse(res.begin(), res.end());
        return res;
    }
};