跟我们的深搜联系起来就是深搜也要走过所有符合题意的路径。因此我们只是需要在深搜的过程中记录一下走过点就是了。临界点就是叶子节点
public List<String> binaryTreePaths(TreeNode root) {
List<String> last = new ArrayList<>();
List<Integer> result = new ArrayList<>();
if (root == null) {
return last;
}
preOrder(root, result, last);
return last;
}
public void preOrder(TreeNode root, List<Integer> result, List<String> last) {
if (root != null) {
result.add(root.val);
if (root.left == null && root.right == null) {
StringBuffer sb = new StringBuffer();
for (int i = 0; i < result.size(); i++) {
sb.append(result.get(i) + "->");
}
sb.deleteCharAt(sb.length() - 1);
sb.deleteCharAt(sb.length() - 1);
last.add(sb.toString());
}
preOrder(root.left, result, last);
preOrder(root.right, result, last);
result.remove(result.size() - 1);
}
}