今天上班搞一整天,只解出一个BUG,结果下班以後脑袋比较灵光?
总之今天是顺利解出来了
题号:129 标题:Sum Root to Leaf Numbers 难度:Medium
You are given the root of a binary tree containing digits from 0 to 9 only.
Each root-to-leaf path in the tree represents a number.
• For example, the root-to-leaf path 1 -> 2 -> 3 represents the number 123.
Return the total sum of all root-to-leaf numbers. Test cases are generated so that the answer will fit in a 32-bit integer.
A leaf node is a node with no children.
Example 1:
Input: root = [1,2,3]
Output: 25
Explanation:
The root-to-leaf path 1->2 represents the number 12.
The root-to-leaf path 1->3 represents the number 13.
Therefore, sum = 12 + 13 = 25.
Example 2:
Input: root = [4,9,0,5,1]
Output: 1026
Explanation:
The root-to-leaf path 4->9->5 represents the number 495.
The root-to-leaf path 4->9->1 represents the number 491.
The root-to-leaf path 4->0 represents the number 40.
Therefore, sum = 495 + 491 + 40 = 1026.
Constraints:
• The number of nodes in the tree is in the range [1, 1000].
• 0 <= Node.val <= 9
• The depth of the tree will not exceed 10.
我的程序码
class Solution {
public int sumNumbers(TreeNode root) {
if(root == null){
return 0;
}else if(root.left==null && root.right==null){
return root.val;
}
TreeNode current = root;
int resultf = 0;
return chk(root,resultf);
}
public int chk(TreeNode now,int result) {
result = result*10 +now.val;
if(now.left==null && now.right == null){
return result;
}
if(now.left==null){
return chk(now.right,result);
}else if(now.right==null){
return chk(now.left,result);
}
return chk(now.left,result) + chk(now.right,result);
}
}
我的逻辑
把每一层的数字乘以十加上这一层的数字,如果有下一层,就往下一层找,重复这个逻辑。
DAY27心得
还剩3天,加油啊
>>: 用React刻自己的投资Dashboard Day27 - 台股技术面刻板
正文 今天来把昨天写的页面进行容器化的动作,首先撰写Dockerfile # static buil...
恭喜你完成物件标记! 还不知道如何操作物件标记或忘记物件标记流程的赶快点开DAY4专案建立与影像标记...
昨天提到 TeamCity 支援几个不同的通知频道,可以在建置任务成功或失败的时候通知我们。不过现在...
大家好,我是乌木白,今天要介绍大家如何使用Git,这一篇不难喔! 如何设定使用者? 每个人使用Gi...
在 Vue3 中我们可以使用 Options API 或是 Composition API 选择一种...