LeetCode刷题记111
129. 求根到叶子节点数字之和
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public int sumNumbers(TreeNode root) {
if (root == null) return 0;
int ans = 0;
Queue<TreeNode> q = new LinkedList<TreeNode>();
q.add(root);
while(q.isEmpty() == false) {
TreeNode tmp = q.poll();
if (tmp.right != null) {
tmp.right.val = tmp.val * 10 + tmp.right.val;
q.add(tmp.right);
}
if (tmp.left != null) {
tmp.left.val = tmp.val * 10 + tmp.left.val;
q.add(tmp.left);
}
if (tmp.left == null && tmp.right == null) {
//System.out.println(tmp.val);
ans += tmp.val;
}
}
return ans;
}
}
3/5
111/150