得到每一个路径的二进制字符串
然后叠加到结果里面返回即可
class Solution {
// public
int ans = 0;
String temp = "";
public void dfs(TreeNode node) {
temp += Integer.toString(node.val);
if (node.left == null && node.right == null) {
ans += Integer.parseInt(temp, 2);
}
if (node.left != null) {
dfs(node.left);
}
if (node.right != null) {
dfs(node.right);
}
temp = temp.substring(0, temp.length() - 1);
}
public int sumRootToLeaf(TreeNode root) {
dfs(root);
return ans;
}
}
总结
Integer.toString
Integer.parseInt(str, 2)
str.substring(begin, end) end不包括



