标签:Binary tree int res Tree Zigzag label return row
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;
}
};
珍妮的选择
发布了351 篇原创文章 · 获赞 7 · 访问量 1万+
私信
关注
标签:Binary,tree,int,res,Tree,Zigzag,label,return,row 来源: https://blog.csdn.net/Eric_1993/article/details/104580062
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。