【leetcode】1022. Sum of Root To Leaf Binary Numbers
2022/1/11 23:34:10
本文主要是介绍【leetcode】1022. Sum of Root To Leaf Binary Numbers,对大家解决编程问题具有一定的参考价值,需要的程序猿们随着小编来一起学习吧!
ou are given the root
of a binary tree where each node has a value 0
or 1
. Each root-to-leaf path represents a binary number starting with the most significant bit.
- For example, if the path is
0 -> 1 -> 1 -> 0 -> 1
, then this could represent01101
in binary, which is13
.
For all leaves in the tree, consider the numbers represented by the path from the root to that leaf. Return the sum of these numbers.
The test cases are generated so that the answer fits in a 32-bits integer.
Example 1:
Input: root = [1,0,1,0,1,0,1] Output: 22 Explanation: (100) + (101) + (110) + (111) = 4 + 5 + 6 + 7 = 22
Example 2:
Input: root = [0] Output: 0
Constraints:
- The number of nodes in the tree is in the range
[1, 1000]
. Node.val
is0
or1
.
简单的递归,需要注意代码格式规范,工作代码被manager吐槽了 qaq。。。
class Solution { public: int res=0; int sumRootToLeaf(TreeNode* root) { digui(root,0); return res; } void digui(TreeNode* node,int tmp){ tmp=tmp*2+node->val; if(node->left!=nullptr){ digui(node->left,tmp); } if(node->right!=nullptr){ digui(node->right,tmp); } if(node->left==nullptr && node->right==nullptr){ res+=tmp; } return; } };
这篇关于【leetcode】1022. Sum of Root To Leaf Binary Numbers的文章就介绍到这儿,希望我们推荐的文章对大家有所帮助,也希望大家多多支持为之网!
- 2024-07-05feign默认connecttimeout和readtimeout是多少-icode9专业技术文章分享
- 2024-07-05idea控制台,日志太多,导致部分想看得日志被刷走 搜不到-icode9专业技术文章分享
- 2024-07-05The server selected protocol version Tls10 is not accepted by client preferences [TLs12]-icode9专业技术文章分享
- 2024-07-05怎么清理项目缓存-icode9专业技术文章分享
- 2024-07-04安装 Eyoucms详细图文教程-icode9专业技术文章分享
- 2024-07-04ueditor 复制文章时,图片的链接是一个下载图片地址,该如何处理?-icode9专业技术文章分享
- 2024-07-04怎样判断host有没有对wordpress有缓存呢-icode9专业技术文章分享
- 2024-07-04具有编译功能的系统make后,无法ssh连接-icode9专业技术文章分享
- 2024-07-04make后如何升级ssh-icode9专业技术文章分享
- 2024-07-03微信支付提示下单账户与支付账户不一致-icode9专业技术文章分享