LeetCode Sum Root to Leaf Numbers

https://oj.leetcode.com/problems/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

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.

这个题目比较简单就是找到所有从根节点到叶子节点的路径来计算和，需要注意的是一个节点可能被多条路径使用。

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {


   	public void getValue(HashMap<TreeNode, Integer>map,TreeNode root,TreeNode sum){
		
		
		if(root.left!=null){
			
			Integer integer = map.get(root.left);
			if(integer == null){
				map.put(root.left, map.get(root).intValue()*10+root.left.val);
			}
			else{
				
				map.remove(root.left);
				map.put(root.left, map.get(root).intValue()*10+root.left.val);
			}
			getValue(map, root.left, sum);
		}

		if(root.right!=null){
			
			Integer integer = map.get(root.right);
			if(integer == null){
				map.put(root.right, map.get(root).intValue()*10+root.right.val);
			}
			else{
				map.remove(root.right);
				map.put(root.right, map.get(root).intValue()*10+root.right.val);
			}
			getValue(map, root.right, sum);
		}
		
		if(root.left==null&&root.right==null){
			sum.val += map.get(root).intValue();
		}
		
	}
	
	public int sumNumbers(TreeNode root) {
	    
	    if(root== null) return 0;
		
		HashMap<TreeNode, Integer> map = new HashMap();
		
		TreeNode sum = new TreeNode(0);
		
		map.put(root, root.val);
		
		getValue(map, root, sum);
        
		return sum.val;
    }


}