public void dsf(TreeNode node, int[] sumPath) {
    	sumPath[1] = sumPath[1] * 10 + node.val;
		if (node.left != null) {
			dsf(node.left, sumPath);
		}
		if (node.right != null) {
			dsf(node.right, sumPath);
		}
		if (node.left == null && node.right == null) {
			sumPath[0] = sumPath[0] + sumPath[1];
		}
		sumPath[1] = (sumPath[1] - node.val) / 10;
	}