import

Author: JavaScalaDeveloper

change/datastructure/TreeNextLinkNode.java

@@ -0,0 +1,36 @@
+package change.datastructure;
+
+/**
+ * 这个实体类包含了二叉树节点的value、左子节点、右子节点和指向父节点的指针。可以根据需求进行修改和扩展。
+ *
+ * 需要注意的是，在构造函数中，我们默认将左子节点、右子节点和父节点初始化为null，因为有些二叉树节点并不一定拥有左右子节点和父节点，这样当节点不存在时，这些变量就能够保证为null。
+ */
+
+public class TreeNextLinkNode extends TreeNode{
+    //指向父亲结点的指针
+    public TreeNextLinkNode next;
+
+    public TreeNextLinkNode(int val, TreeNode left, TreeNode right, TreeNextLinkNode next) {
+        super(val, left, right);
+        this.next = next;
+    }
+
+    public TreeNextLinkNode(int val, TreeNextLinkNode next) {
+        super(val);
+        this.next = next;
+    }
+
+    public TreeNextLinkNode(TreeNextLinkNode next) {
+        this.next = next;
+    }
+    public TreeNextLinkNode() {
+    }
+
+    public TreeNextLinkNode getNext() {
+        return next;
+    }
+
+    public void setNext(TreeNextLinkNode next) {
+        this.next = next;
+    }
+}

change/datastructure/TreeLinkNode.java renamed to change/datastructure/TreeParentLinkNode.java

@@ -6,23 +6,23 @@
  * 需要注意的是，在构造函数中，我们默认将左子节点、右子节点和父节点初始化为null，因为有些二叉树节点并不一定拥有左右子节点和父节点，这样当节点不存在时，这些变量就能够保证为null。
  */
 //@Data
-public class TreeLinkNode extends TreeNode{
+public class TreeParentLinkNode extends TreeNode{
     //指向父亲结点的指针
-    public TreeLinkNode parent = null;
+    public TreeParentLinkNode parent = null;
 
-    public TreeLinkNode() {
+    public TreeParentLinkNode() {
     }
 
-    public TreeLinkNode(int val) {
+    public TreeParentLinkNode(int val) {
         this.val = val;
     }
 
-    public TreeLinkNode(int val, TreeNode left, TreeNode right, TreeLinkNode parent) {
+    public TreeParentLinkNode(int val, TreeNode left, TreeNode right, TreeParentLinkNode parent) {
         super(val, left, right);
         this.parent = parent;
     }
 
-    public TreeLinkNode(int val, TreeLinkNode left, TreeLinkNode right, TreeLinkNode parent) {
+    public TreeParentLinkNode(int val, TreeParentLinkNode left, TreeParentLinkNode right, TreeParentLinkNode parent) {
         this.val = val;
         this.left = left;
         this.right = right;

change/scripts/Main.java

@@ -1,35 +1,36 @@
 package change.scripts;
 
-import java.io.IOException;
+import change.datastructure.ListNode;
+import change.tools.listnode.ListNodeUtils;
 
-import java.nio.file.Files;
-import java.nio.file.Paths;
-import java.util.regex.Matcher;
-import java.util.regex.Pattern;
 
 public class Main {
     public static void main(String[] args) {
-        String filePath = "D:\\WorkSpaces\\leetcode-all\\solution\\0000-0099\\0001.Two Sum\\README.md";
-        String str = null;
-        try {
-            str = new String(Files.readAllBytes(Paths.get(filePath)));
-        } catch (IOException e) {
-            e.printStackTrace();
-        }
-
+//        1,2,3,4 -> 2,1,4,3
+        ListNode listNode = new ListNode(1, new ListNode(2, new ListNode(3, new ListNode(4))));
+        ListNode res = reverse(listNode);
+        System.out.println(ListNodeUtils.getValues(res));
+    }
 
-//        String str = "caergblkmghfaersnecsblixetwey";
-        Pattern pattern = Pattern.compile("");
-        Matcher matcher = pattern.matcher(str);
-        if (matcher.find()) {
-            int startIndex = matcher.start();
-            int endIndex = matcher.end();
-            String result = str.substring(0, startIndex) + str.substring(endIndex);
-            System.out.println(result);
-        } else {
-            System.out.println(str);
+    private static ListNode reverse(ListNode listNode) {
+        ListNode cur=listNode; //234
+        boolean flag=false;
+        int val=0;
+        while (cur.next != null) {
+            if (!flag) {
+                cur.val= cur.next.val;
+                val = cur.val;
+            } else {
+                cur.val=val;
+            }
+            cur=cur.next;
+//            ListNode next = cur.next;
+//            cur.next=pre;
+//            pre=cur;
+//            cur=next;
         }
+        return cur;
+    }
 
 
-    }
 }

change/scripts/MergeMdFiles.java

@@ -1,6 +1,8 @@
 package change.scripts;
 
 import java.io.*;
+import java.nio.file.Files;
+import java.nio.file.attribute.BasicFileAttributes;
 
 public class MergeMdFiles {
 
@@ -21,10 +23,12 @@ public static void main(String[] args) throws IOException {
 
     private static void mergeMdFiles(File dir, OutputStream os) throws IOException {
         File[] files = dir.listFiles();
+        assert files != null;
         for (File file : files) {
-            if (file.isDirectory()) {
+            BasicFileAttributes basicFileAttributes = Files.readAttributes(file.toPath(), BasicFileAttributes.class);
+            if (basicFileAttributes.isDirectory()) {
                 mergeMdFiles(file, os);
-            } else if (file.isFile() && file.getName().endsWith(".md")) {
+            } else if (basicFileAttributes.isRegularFile() && file.getName().endsWith(".md")) {
 //                忽略solution根目录的文件
                 if (file.getPath().length() > 60) {
 //                    String num = file.getPath().substring(46, 50);

change/scripts/MergeMdFilesByLevel.java

@@ -9,7 +9,7 @@
 
 public class MergeMdFilesByLevel {
     //    前1500道
-    private static final int MAX_NUM = 1500;
+    private static final int MAX_NUM = 3000;
     private static final String OUTPUT_PATH = "D:\\WorkSpaces\\leetcode-all\\change\\scripts\\out\\"; // 修改为输出文件路径
     //题号->难度
     private static final Map<String, String> num2LevelMap = ParseMenu.getLineData().stream()
@@ -25,8 +25,8 @@ public static void main(String[] args) throws IOException {
         }
         Map<String, FileOutputStream> fileOutputStreamsMap = new HashMap<>();
 //        中等, 困难, 简单
-        fileOutputStreamsMap.put("简单", new FileOutputStream(OUTPUT_PATH + "easy-0~" + MAX_NUM + "-v2023.md"));
-        fileOutputStreamsMap.put("中等", new FileOutputStream(OUTPUT_PATH + "medium-0~" + MAX_NUM + "-v2023.md"));
+//        fileOutputStreamsMap.put("简单", new FileOutputStream(OUTPUT_PATH + "easy-0~" + MAX_NUM + "-v2023.md"));
+//        fileOutputStreamsMap.put("中等", new FileOutputStream(OUTPUT_PATH + "medium-0~" + MAX_NUM + "-v2023.md"));
         fileOutputStreamsMap.put("困难", new FileOutputStream(OUTPUT_PATH + "hard-0~" + MAX_NUM + "-v2023.md"));
 
         mergeMdFiles(dir, fileOutputStreamsMap);

change/scripts/ParseMenu.java

@@ -1,7 +1,6 @@
 package change.scripts;
 
 import java.io.BufferedReader;
-import java.io.FileInputStream;
 import java.io.IOException;
 import java.io.InputStreamReader;
 import java.nio.file.Files;

change/scripts/out/easy-0~1500-v2023.pdf

@@ -15,12 +15,17 @@
  */
 package com.solution._0100;
 import change.datastructure.*;
+import change.tools.listnode.TreeNodeUtils;
+
 import java.util.*;
 public class Solution {
     public static void main(String[] args) {
-
+        TreeNode treeNode1 = TreeNodeUtils.buildTree();
+        TreeNode treeNode2 = TreeNodeUtils.buildTree();
+        boolean res = isSameTree(treeNode1, treeNode2);
+        System.out.println(res);
     }
-    public boolean isSameTree(TreeNode p, TreeNode q) {
+    public static boolean isSameTree(TreeNode p, TreeNode q) {
         if (p == q) return true;
         if (p == null || q == null || p.val != q.val) return false;
         return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);