【leetcode】1104. 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

解题思路：先把正常的路径(即不是蛇形排列的数)求出来，接下来自底向顶遍历，偶数行的值需要交换，交换的逻辑也很简单，求出该层最左边和最右边的节点的number，记为low和一个high，那么对于number为inx的节点，其交换后的number就是： (low + high) - inx。

代码如下：

class Solution(object):def pathInZigZagTree(self, label):""":type label: int:rtype: List[int]"""res = []level = 0while label != 0:res.insert(0,label)label = label/2level += 1swap = Falsewhile level > 0:if swap:low = 2**(level-1)high = (low * 2 - 1)res[level-1] = (low + high) - res[level-1]swap = not swaplevel -= 1return res

转载于:https://www.cnblogs.com/seyjs/p/11131279.html

【leetcode】1104. Path In Zigzag Labelled Binary Tree相关推荐

LeetCode 1104. Path In Zigzag Labelled Binary Tree解题报告
1104. Path In Zigzag Labelled Binary Tree Path In Zigzag Labelled Binary Tree python solution 题目描述 I ...
1104. Path In Zigzag Labelled Binary Tree**
1104. Path In Zigzag Labelled Binary Tree** https://leetcode.com/problems/path-in-zigzag-labelled-bi ...
1104 Path In Zigzag Labelled Binary Tree
1 题目 In an infinite binary tree where every node has two children, the nodes are labelled in row ord ...
LeetCode——1104. 二叉树寻路(Path In Zigzag Labelled Binary Tree)[中等]——分析及代码（Java）
LeetCode--1104. 二叉树寻路[Path In Zigzag Labelled Binary Tree][中等]--分析及代码[Java] 一.题目二.分析及代码 1. 按位置求解 (1 ...
LeetCode-1104. Path In Zigzag Labelled Binary Tree
LeetCode-1104. Path In Zigzag Labelled Binary Tree 题目描述:https://leetcode.com/problems/path-in-zigzag ...
LeetCode每日一题(Path In Zigzag Labelled Binary Tree)
In an infinite binary tree where every node has two children, the nodes are labelled in row order. I ...
[Swift]LeetCode1104. 二叉树寻路 | Path In Zigzag Labelled Binary Tree
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★ ➤微信公众号:山青咏芝(shanqingyongzhi) ➤博客园地址:山青咏芝(https://www.cnblog ...
leetcode1104. Path In Zigzag Labelled Binary Tree
题目链接这个题很容易首先联想到完全二叉树的性质,父结点下标i,如果有左儿子,左儿子下标2i,如果有右儿子,右儿子下标2i+1,相应的一个结点的父结点就是i/2下取整.但是因为这个题在偶数行是从右到左 ...
Path In Zigzag Labelled Binary Tree（C++二叉树寻路）
解题思路: (1)从下往上,除2,注意左右顺序 class Solution { private:vector<int> v; public:void parent(int label) ...

【leetcode】1104. Path In Zigzag Labelled Binary Tree

【leetcode】1104. Path In Zigzag Labelled Binary Tree相关推荐

最新文章

热门文章