LeetCode OJ - Sum Root to Leaf Numbers

这道题也很简单，只要把二叉树按照宽度优先的策略遍历一遍，就可以解决问题，采用递归方法越是简单。

下面是AC代码：


 1 /**

 2      * Sum Root to Leaf Numbers

 3      * 采用递归的方法，宽度遍历

 4      */

 5     int result=0;

 6     public int sumNumbers(TreeNode root){

 7

 8         bFSearch(root,0);

 9         return result;

10     }

11     private void bFSearch(TreeNode root, int sum){

12         //a path has been finished

13         if(root.left == null && root.right == null)

14         {

15             result += sum*10+root.val;

16             return;

17         }

18         if(root.left !=null)

19             bFSearch(root.left,  sum*10+root.val);

20         if(root.right != null)

21             bFSearch(root.right,  sum*10+root.val);

22     }

LeetCode OJ - Sum Root to Leaf Numbers,布布扣,bubuko.com

时间： 2024-10-06 00:38:56

LeetCode OJ - Sum Root to Leaf Numbers的相关文章

Leetcode dfs Sum Root to Leaf Numbers

Sum Root to Leaf Numbers Total Accepted: 20237 Total Submissions: 67979My Submissions 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

[C++]LeetCode: 94 Sum Root to Leaf Numbers （先序遍历）

题目: 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

Java for LeetCode 129 Sum Root to Leaf Numbers

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 T

LeetCode[Tree]: Sum Root to Leaf Numbers

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

[Leetcode][JAVA] Sum Root to Leaf Numbers

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  

【leetcode】Sum Root to Leaf Numbers（hard）

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 T

【LeetCode】Sum Root to Leaf Numbers 解题报告

[题目] 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 /

leetCode(36):Sum Root to Leaf Numbers

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 T

Leetcode#129 Sum Root to Leaf Numbers

原题地址 二叉树的遍历 代码: 1 vector<int> path; 2 3 int sumNumbers(TreeNode *root) { 4 if (!root) 5 return 0; 6 7 int sum = 0; 8 path.push_back(root->val); 9 10 if (!root->left && !root->right) { 11 for (int i = 0; i < path.size(); i++) 12 s