Sum Root to Leaf Numbers
来源:互联网 发布:mac不识别u盘启动 编辑:程序博客网 时间:2024/04/20 03:56
Problem:
Given a binary tree containing digits from 0-9
only, each root-to-leaf path could represent a number.
An example is the root-to-leaf path 1->2->3
which represents the number 123
.
Find the total sum of all root-to-leaf numbers.
For example,
1 / \ 2 3
The root-to-leaf path 1->2
represents the number 12
.
The root-to-leaf path 1->3
represents the number 13
.
Return the sum = 12 + 13 = 25
.
Solution:
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public int sumNumbers(TreeNode root) {
if(root==null)
return 0;
int sum = 0;
Stack<TreeNode> st = new Stack<>();
st.push(root);
while(!st.empty())
{
TreeNode node = st.pop();
while(node.left!=null)
{
node.left.val += node.val*10;
if(node.right!=null)
{
node.right.val += node.val*10;
st.push(node.right);
}
node = node.left;
}
if(node.right!=null)
{
node.right.val += node.val*10;
st.push(node.right);
}
else
{
sum += node.val;
}
}
return sum;
}
}
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public int sumNumbers(TreeNode root) {
if(root==null)
return 0;
int sum = 0;
Stack<TreeNode> st = new Stack<>();
st.push(root);
while(!st.empty())
{
TreeNode node = st.pop();
while(node.left!=null)
{
node.left.val += node.val*10;
if(node.right!=null)
{
node.right.val += node.val*10;
st.push(node.right);
}
node = node.left;
}
if(node.right!=null)
{
node.right.val += node.val*10;
st.push(node.right);
}
else
{
sum += node.val;
}
}
return sum;
}
}
0 0
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- 数字图像之边缘检测(1)
- 检索地理位置(GeocodeService服务)
- Palindrome Partitioning II
- Surrounded Regions
- 【异或】SOJ Find Differences
- Sum Root to Leaf Numbers
- day38,page60,total390
- Longest Consecutive Sequence
- ubuntu 下eclipse 打不开
- Word Ladder
- 各种工业以太网比较(EtherCAT,EtherNet/IP,ProfiNet,Modbus-TCP,Powerlink)
- VMware上新建windows 10 虚拟机(1)
- Binary Tree Maximum Path Sum
- Best Time to Buy and Sell Stock