回溯和深搜还是要练
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
List<String> res = new LinkedList<>();
public List<String> binaryTreePaths(TreeNode root) {
StringBuilder s = new StringBuilder();
dfs(root,s);
return res;
}
void dfs(TreeNode root, StringBuilder s){
if(root==null) return ;
StringBuilder ss = new StringBuilder(s);
ss.append(Integer.toString(root.val));
if(root.left==null&&root.right==null){
res.add(ss.toString());
}else{
ss.append("->");
dfs(root.left,ss);
dfs(root.right,ss);
}
}
}
还有很多东西要学习呢