"Leetcode-Interview algorithm classic-java implementation" "129-sum root to Leaf Numbers (all root-to-leaf node group composed of numbers added)"

"129-sum root to leaf Numbers (total number of root to leaf node group)" "leetcode-Interview algorithm classic-java Implementation" "All Topics folder Index" Original Question

Given a binary tree containing digits from 0-9 to, 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 to the sum = 12 + 13 = 25 .

Main Topic

Given a binary tree. Each node has a value of 0-9. The roots to the leaves make up a number, and all the roots to the leaves are composed of numbers.

Thinking of solving problems

Using backtracking methods.

Code Implementation

Algorithm implementation class

 Public classSolution {Private intresult =0;//Record the total results    Private intnum =0;//record root to leaf number     Public int sumnumbers(TreeNode Root) {sum (root);returnResult }Private void sum(TreeNode Root) {if(Root! =NULL) {num = num*Ten+ Root.val;//has reached the root node.            if(Root.left = =NULL&& Root.right = =NULL{result + = num;            } sum (Root.left);            SUM (root.right); Num/=Ten; }    }}

Assessment Results

　　Click on the picture, the mouse does not release, drag a position, release after the new form to view the full picture.

Special Instructions Welcome reprint. Reprint Please specify the source "http://blog.csdn.net/derrantcm/article/details/47678205"

"Leetcode-Interview algorithm classic-java implementation" "129-sum root to Leaf Numbers (all root-to-leaf node group composed of numbers added)"