public List<String> binaryTreePaths(TreeNode root) {
List<String> res = new ArrayList<>();
if (root == null) {
return res;
}
if (root.left == null && root.right == null) {
res.add(String.valueOf(root.val));
return res;
}
List<String> leftS = binaryTreePaths(root.left);
List<String> rightS = binaryTreePaths(root.right);
for (String left : leftS) {
res.add(root.val+"->"+left);
}
for (String right : rightS) {
res.add(root.val+"->"+right);
}
return res;
}
Leetcode257:二叉树的所有路径
最新推荐文章于 2024-05-02 11:51:02 发布