ok

NoteXYX · NoteXYX · commit 2dc5684b3287 · 2020-09-05T00:32:04.000+08:00
diff --git a/src/com/leetcode/Main257.java b/src/com/leetcode/Main257.java
@@ -0,0 +1,67 @@
+package com.leetcode;
+
+import java.util.ArrayList;
+import java.util.List;
+
+/**
+ * 257. 二叉树的所有路径
+ * 给定一个二叉树，返回所有从根节点到叶子节点的路径。
+ *
+ * 说明: 叶子节点是指没有子节点的节点。
+ *
+ * 示例:
+ *
+ * 输入:
+ *
+ *    1
+ *  /   \
+ * 2     3
+ *  \
+ *   5
+ *
+ * 输出: ["1->2->5", "1->3"]
+ *
+ * 解释: 所有根节点到叶子节点的路径为: 1->2->5, 1->3
+
+ */
+public class Main257 {
+    public static class TreeNode {
+        int val;
+        TreeNode left;
+        TreeNode right;
+        TreeNode(int x) { val = x; }
+    }
+    public List<String> list = new ArrayList<>();
+    public void search(TreeNode root, String str) {
+        if (root.left == null && root.right == null) {
+            str += root.val;
+            list.add(str);
+            return;
+        }
+        str += root.val + "->";
+        if (root.left != null) {
+            search(root.left, str);
+        }
+        if (root.right != null) {
+            search(root.right, str);
+        }
+    }
+
+    public List<String> binaryTreePaths(TreeNode root) {
+        if (root == null)
+            return new ArrayList<>();
+        search(root, "");
+        return list;
+    }
+
+    public static void main(String[] args) {
+        TreeNode root = new TreeNode(1);
+        root.left = new TreeNode(2);
+        root.right = new TreeNode(3);
+        root.left.left = new TreeNode(4);
+        Main257 m = new Main257();
+        List<String> list = m.binaryTreePaths(root);
+        System.out.println(list);
+
+    }
+}
diff --git a/src/com/leetcode/Sort.java b/src/com/leetcode/Sort.java
@@ -192,12 +192,6 @@ public void heapify(int[] nums, int curNode, int heapSize) {
             heapify(nums, largest, heapSize);
         }
     }
-
-//    public void swap(int[] nums, int x, int y) {
-//        int tmp = nums[x];
-//        nums[x] = nums[y];
-//        nums[y] = tmp;
-//    }
     /********************************堆排序*******************************************/
 
     public static void main(String[] args) {

Original file line number	Diff line number	Diff line change
`@@ -192,12 +192,6 @@ public void heapify(int[] nums, int curNode, int heapSize) {`
`192`	`192`	`heapify(nums, largest, heapSize);`
`193`	`193`	`}`
`194`	`194`	`}`
`195`		`-`
`196`		`-// public void swap(int[] nums, int x, int y) {`
`197`		`-// int tmp = nums[x];`
`198`		`-// nums[x] = nums[y];`
`199`		`-// nums[y] = tmp;`
`200`		`-// }`
`201`	`195`	`/******************************堆排序*****************************************/`
`202`	`196`
`203`	`197`	`public static void main(String[] args) {`