添加所有class的包名

Author: JavaScalaDeveloper

change/datastructure/ListNode.java

@@ -0,0 +1,22 @@
+package change.datastructure;
+
+
+/**
+ * 链表
+ */
+public class ListNode {
+    public int val;
+    public ListNode next = null;
+
+    public ListNode(int val) {
+        this.val = val;
+    }
+
+    public ListNode() {
+    }
+
+    public ListNode(int val, ListNode next) {
+        this.val = val;
+        this.next = next;
+    }
+}

change/datastructure/TreeLinkNode.java

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

change/datastructure/TreeNode.java

@@ -0,0 +1,24 @@
+package change.datastructure;
+
+/**
+ * 二叉树
+ */
+//@Data
+public class TreeNode {
+    public int val;
+    public TreeNode left = null;
+    public TreeNode right = null;
+
+    public TreeNode(int val, TreeNode left, TreeNode right) {
+        this.val = val;
+        this.left = left;
+        this.right = right;
+    }
+
+    public TreeNode(int val) {
+        this.val = val;
+    }
+
+    public TreeNode() {
+    }
+}

change/scripts/AddPackagePrefix.java

@@ -0,0 +1,82 @@
+package change.scripts;
+import java.io.*;
+import java.nio.charset.StandardCharsets;
+
+public class AddPackagePrefix {
+    static final String pathName = "D:\\WorkSpaces\\leetcode-all\\solution\\0000-0099";
+
+
+    public static void main(String[] args) {
+        // 获取当前目录名
+        File currentDir = new File(pathName);
+        String dirName = currentDir.getName();
+        // 定义要添加的包名
+        String packageName = "com.solution." + dirName;
+        // 获取目录下的所有 .java 文件并修改其中的包名
+        modifyPackagePrefix(new File(pathName), packageName);
+    }
+
+    /**
+     * 遍历目录下的所有指定文件类型，并修改代码中的包名前缀
+     *
+     * @param directory   目录
+     * @param packageName 要添加的包名前缀
+     */
+    public static void modifyPackagePrefix(File directory, String packageName) {
+        if (directory.isDirectory()) {
+            // 获取目录下的所有文件和子目录
+            File[] files = directory.listFiles();
+            if (files != null) {
+                for (File file : files) {
+                    if (file.isDirectory()) {
+                        // 如果是子目录，则递归调用 modifyPackagePrefix 方法
+                        modifyPackagePrefix(file, packageName + "." + file.getName());
+                    } else if (file.getName().endsWith(".java")) {
+                        // 如果是 .java 文件，则修改其中的包名前缀
+                        modifyJavaFilePackage(file, packageName);
+                    }
+                }
+            }
+        }
+    }
+
+    /**
+     * 修改 Java 文件中的包名前缀
+     *
+     * @param javaFile    Java 文件
+     * @param packageName 包名前缀
+     */
+    public static void modifyJavaFilePackage(File javaFile, String packageName) {
+        StringBuilder stringBuilder = new StringBuilder();
+        BufferedReader bufferedReader = null;
+        BufferedWriter bufferedWriter = null;
+        try {
+            // 读取文件内容
+            bufferedReader = new BufferedReader(new InputStreamReader(new FileInputStream(javaFile), StandardCharsets.UTF_8));
+            String line;
+            while ((line = bufferedReader.readLine()) != null) {
+                // 如果文件内容中没有 package 语句，则添加新的包名
+                if (line.startsWith("package ")) {
+                    line = "package " + packageName + ";";
+                }
+                stringBuilder.append(line).append('\n');
+            }
+            // 写入文件内容
+            bufferedWriter = new BufferedWriter(new OutputStreamWriter(new FileOutputStream(javaFile), StandardCharsets.UTF_8));
+            bufferedWriter.write(stringBuilder.toString());
+        } catch (IOException e) {
+            e.printStackTrace();
+        } finally {
+            try {
+                if (bufferedReader != null) {
+                    bufferedReader.close();
+                }
+                if (bufferedWriter != null) {
+                    bufferedWriter.close();
+                }
+            } catch (IOException e) {
+                e.printStackTrace();
+            }
+        }
+    }
+}

change/tools/listnode/ArrayUtils.java

@@ -0,0 +1,14 @@
+package change.tools.listnode;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class ArrayUtils {
+    public static List<Integer> toList(int[] arr) {
+        List<Integer> list = new ArrayList<>();
+        for (int j : arr) {
+            list.add(j);
+        }
+        return list;
+    }
+}

change/tools/listnode/ListNodeUtils.java

@@ -0,0 +1,74 @@
+package change.tools.listnode;
+
+
+import change.datastructure.*;
+import java.util.*;
+
+/**
+ * 链表工具类
+ */
+public class ListNodeUtils {
+    public static void main(String[] args) {
+        ListNode listNode = new ListNode(1, new ListNode(2, new ListNode(3, new ListNode(4, null))));
+        List<Integer> values = ListNodeUtils.getValues(listNode);
+        System.out.println(values);
+
+
+//        构造链表
+        ListNode head = new ListNode(1, null);
+        ListNode medium = new ListNode(4, new ListNode(5, head));
+        ListNode tail = new ListNode(2, new ListNode(3, medium));
+        head.next = medium;
+        List<Integer> circularList = ListNodeUtils.getCircularList(tail);
+        System.out.println(circularList);
+    }
+
+    public static List<Integer> getValues(ListNode listNode) {
+        List<Integer> list = new ArrayList<>();
+        if (listNode == null) {
+            return list;
+        }
+        list.add(listNode.val);
+        while (listNode.next != null) {
+            listNode = listNode.next;
+            list.add(listNode.val);
+        }
+        return list;
+    }
+
+    /**
+     * 获取环状链表的值
+     *
+     * @param head 环状链表
+     * @return 值
+     */
+    public static List<Integer> getCircularList(ListNode head) {
+        List<Integer> list = new ArrayList<>();
+        ListNode slow = head;
+        ListNode fast = head;
+        boolean hasCycle = false;
+        //快慢指针遍历链表，判断是否存在环
+        while (fast != null && fast.next != null) {
+            fast = fast.next.next;
+            slow = slow.next;
+            if (slow == fast) {
+                //相遇点，存在环
+                hasCycle = true;
+                break;
+            }
+        }
+        if (hasCycle) {
+            //慢指针从相遇点继续往前走一圈回到相遇点
+            slow = head;
+            while (slow != fast) {
+                list.add(slow.val);
+                slow = slow.next;
+                fast = fast.next;
+            }
+            //输出环入口和后续结点
+            list.add(fast.val);
+        }
+        return list;
+    }
+
+}

change/tools/listnode/TreeNodeUtils.java

@@ -0,0 +1,44 @@
+package change.tools.listnode;
+
+import change.datastructure.TreeNode;
+
+public class TreeNodeUtils {
+    public static void printTree(TreeNode root) {
+        printNode(root, "", false);
+    }
+
+    private static void printNode(TreeNode node, String prefix, boolean isLeft) {
+        if (node == null) {
+            return;
+        }
+        System.out.println(prefix + (isLeft ? "├──" : "└──") + node.val);
+        printNode(node.left, prefix + (isLeft ? "│   " : "    "), true);
+        printNode(node.right, prefix + (isLeft ? "│   " : "    "), false);
+    }
+
+    /*
+      构建一个二叉树
+      @return TreeNode
+                1
+              /   \
+             2     3
+            / \   / \
+           4   5 6   7
+     */
+    public static TreeNode buildTree() {
+        TreeNode root = new TreeNode(1);
+        root.left = new TreeNode(2);
+        root.right = new TreeNode(3);
+//        root.left.parent = root;
+//        root.right.parent = root;
+        root.left.left = new TreeNode(4);
+        root.left.right = new TreeNode(5);
+//        root.left.left.parent = root.left;
+//        root.left.right.parent = root.left;
+        root.right.left = new TreeNode(6);
+        root.right.right = new TreeNode(7);
+//        root.right.left.parent = root.right;
+//        root.right.right.parent = root.right;
+        return root;
+    }
+}