重命名包路径以简化项目结构

src/main/java/cn/whaifree/leetCode/Dynamic/LeetCode516.java

@@ -0,0 +1,51 @@
+package cn.whaifree.leetCode.Dynamic;
+
+import org.junit.Test;
+
+/**
+ * @version 1.0
+ * @Author whai文海
+ * @Date 2024/5/2 15:57
+ * @注释
+ */
+public class LeetCode516 {
+    @Test
+    public void test()
+    {
+        Solution solution = new Solution();
+        System.out.println(solution.longestPalindromeSubseq("bbbab"));
+    }
+
+    class Solution {
+        /**
+         * 子序列
+         * dp[i][j] 表示 i-j的最长回文子序列长度
+         *    0 1 2 3 4
+         * 0  1
+         * 1  2 1
+         * 2  3 2 1
+         * 3  3 2 1 1  不相等取上、右边的最大值
+         * 4  4 3 3 1 1  相等 取dp[i+1][j-1]+2
+         *
+         * @param s
+         * @return
+         */
+        public int longestPalindromeSubseq(String s) {
+            int[][] dp = new int[s.length()][s.length()];
+            for (int i = 0; i < s.length(); i++) {
+                for (int j = i; j >= 0; j--) {
+                    if (i == j) {
+                        dp[i][j] = 1;
+                        continue;
+                    }
+                    if (s.charAt(i) == s.charAt(j)) {
+                        dp[i][j]= dp[i - 1][j + 1] + 2;
+                    }else {
+                        dp[i][j] = Math.max(dp[i - 1][j], dp[i][j + 1]);
+                    }
+                }
+            }
+            return dp[s.length() - 1][0];
+        }
+    }
+}

src/main/java/cn/whaifree/leetCode/Dynamic/LeetCode583.java

@@ -0,0 +1,102 @@
+package cn.whaifree.leetCode.Dynamic;
+
+import org.junit.Test;
+
+/**
+ * @version 1.0
+ * @Author whai文海
+ * @Date 2024/5/2 11:14
+ * @注释
+ */
+public class LeetCode583 {
+    @Test
+    public void test()
+    {
+
+        //  "leetcode", word2 = "etco"
+        int i = new Solution1().minDistance("leetcode", "etco");
+        System.out.println(i);
+    }
+
+    class Solution {
+        /**
+         * 最长子序列的长度
+         * word1.len - dp
+         * word2.len - dp
+         * @param word1
+         * @param word2
+         * @return
+         */
+        public int minDistance(String word1, String word2) {
+            /**
+             * dp[i][j] 表示 word1的0-i word2的0-j 最长公共子序列的长度
+             *
+             *    '' s e a
+             * ''  0 0 0 0
+             * e   0 0 1 1
+             * a   0 0 1 2
+             * t   0 0 1 2
+             *
+             */
+
+            int len2 = word2.length();
+            int len1 = word1.length();
+            int[][] dp = new int[len1 + 1][len2 + 1];
+
+            for (int i = 1; i <= len1; i++) {
+                for (int j = 1; j <= len2; j++) {
+                    if (word1.charAt(i - 1) == word2.charAt(j - 1)) {
+                        dp[i][j] = dp[i - 1][j - 1] + 1;
+                    } else {
+                        dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
+                    }
+                }
+            }
+            return len1 + len2 - (dp[len1][len2] << 1);
+        }
+
+    }
+
+    class Solution1 {
+        /**
+         * dp[i][j]：以i-1为结尾的字符串word1，和以j-1位结尾的字符串word2，想要达到相等，所需要删除元素的最少次数。
+         *    '' s e a
+         * ''  0 1 2 3
+         * e   1 2 1 2
+         * a   2 3 2 1
+         * t   3 4 3 2
+         * 等 dp[i-1][j-1]
+         * 不等 min(dp[i-1][j], dp[i][j-1]) + 1
+         * 1. 删word1[i - 1]，最少操作次数为dp[i - 1][j] + 1
+         * 2. 删word2[j - 1]，最少操作次数为dp[i][j - 1] + 1
+         * 3. 同时删word1[i - 1]和word2[j - 1]，操作的最少次数为dp[i - 1][j - 1] + 2
+         *          dp[i][j - 1] + 1 = dp[i - 1][j - 1] + 2
+         * @param word1
+         * @param word2
+         * @return
+         */
+        public int minDistance(String word1, String word2) {
+            int len2 = word2.length();
+            int len1 = word1.length();
+            int[][] dp = new int[len1 + 1][len2 + 1];
+
+            for (int i = 1; i <= len1; i++) {
+                dp[i][0] = i;
+            }
+            for (int j = 1; j <= len2; j++) {
+                dp[0][j] = j;
+            }
+
+            for (int i = 1; i <= len1; i++) {
+                for (int j = 1; j <= len2; j++) {
+                    if (word1.charAt(i - 1) == word2.charAt(j - 1)) {
+                        dp[i][j] = dp[i - 1][j - 1];
+                    } else {
+                        dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - 1]) + 1;
+                    }
+                }
+            }
+            return dp[len1][len2];
+        }
+    }
+}

src/main/java/cn/whaifree/leetCode/Dynamic/LeetCode647_1.java

@@ -0,0 +1,65 @@
+package cn.whaifree.leetCode.Dynamic;
+
+import org.junit.Test;
+
+/**
+ * @version 1.0
+ * @Author whai文海
+ * @Date 2024/5/2 12:00
+ * @注释
+ */
+public class LeetCode647_1 {
+    @Test
+    public void test()
+    {
+        String s = "abc";
+        System.out.println(new Solution().countSubstrings(s));
+    }
+
+    class Solution {
+        /**
+         *
+         * 给你一个字符串 s ，请你统计并返回这个字符串中 回文子串 的数目
+         *
+         * dp[i][j] 表示 i-j回文字符串的数量
+         *
+         * dp[i][j] 由 dp[i+1][j-1]推出
+         * if n[i]==n[j]
+         *      dp[i][j] = dp[i-1][j-1]+2
+         * else
+         *      dp[i][j] = dp[i][j-1]+dp[i+1][j]
+         *
+         *   abac
+         *    '' 0 1 2 3
+         * ''  0 0 0 0 0
+         *  0  0 1
+         *  1  0 0 1
+         *  2  0 1 0 1
+         *  3  0 0 0 0 1
+         *
+         *
+         * @param s
+         * @return
+         */
+        public int countSubstrings(String s) {
+            boolean[][] dp = new boolean[s.length()][s.length()];
+            int res = 0;
+            for (int i = 0; i < s.length(); i++) {
+                for (int j = i; j >= 0; j--) {
+                    if (i == j ) {
+                        dp[i][j] = true;
+                        res++;
+                        continue;
+                    }
+                    if ((s.charAt(i) == s.charAt(j)) && (i == j + 1 || dp[i - 1][j + 1])) {
+                        dp[i][j] = true;
+                        res++;
+                    }
+                }
+            }
+            return res;
+        }
+    }
+
+
+}

src/main/java/cn/whaifree/redo/redo/redo_24_1_13/LeetCode203.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_13;
+package cn.whaifree.redo.redo.redo_24_1_13;
 
 import cn.whaifree.leetCode.model.ListNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_1_13/LeetCode209.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_13;
+package cn.whaifree.redo.redo.redo_24_1_13;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_1_13/LeetCode225.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_13;
+package cn.whaifree.redo.redo.redo_24_1_13;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_1_13/LeetCode232.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_13;
+package cn.whaifree.redo.redo.redo_24_1_13;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_1_13/LeetCode239_false.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_13;
+package cn.whaifree.redo.redo.redo_24_1_13;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_1_13/LeetCode2487.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_13;
+package cn.whaifree.redo.redo.redo_24_1_13;
 
 import cn.whaifree.leetCode.model.ListNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_1_13/LeetCode28.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_13;
+package cn.whaifree.redo.redo.redo_24_1_13;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_1_13/LeetCode287.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_13;
+package cn.whaifree.redo.redo.redo_24_1_13;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_1_13/LeetCode347.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_13;
+package cn.whaifree.redo.redo.redo_24_1_13;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_1_20/LeetCode199.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_20;
+package cn.whaifree.redo.redo.redo_24_1_20;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_1_20/LeetCode94.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_20;
+package cn.whaifree.redo.redo.redo_24_1_20;
 
 import cn.whaifree.leetCode.LinkedList.LeetCode142;
 import cn.whaifree.leetCode.model.TreeNode;

src/main/java/cn/whaifree/redo/redo/redo_24_1_27/LeetCode101.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_27;
+package cn.whaifree.redo.redo.redo_24_1_27;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_1_27/LeetCode105_106.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_27;
+package cn.whaifree.redo.redo.redo_24_1_27;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_1_27/LeetCode110.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_27;
+package cn.whaifree.redo.redo.redo_24_1_27;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_1_27/LeetCode222.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_27;
+package cn.whaifree.redo.redo.redo_24_1_27;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_1_27/LeetCode257.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_27;
+package cn.whaifree.redo.redo.redo_24_1_27;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_1_7/LeetCode15.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_7;
+package cn.whaifree.redo.redo.redo_24_1_7;
 
 
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_1_7/LeetCode151.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_7;
+package cn.whaifree.redo.redo.redo_24_1_7;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_1_7/LeetCode18.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_7;
+package cn.whaifree.redo.redo.redo_24_1_7;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_1_7/LeetCode202.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_7;
+package cn.whaifree.redo.redo.redo_24_1_7;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_1_7/LeetCode203_false.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_7;
+package cn.whaifree.redo.redo.redo_24_1_7;
 
 
 import cn.whaifree.leetCode.model.ListNode;

src/main/java/cn/whaifree/redo/redo/redo_24_1_7/LeetCode206_false.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_7;
+package cn.whaifree.redo.redo.redo_24_1_7;
 
 import cn.whaifree.leetCode.model.ListNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_1_7/LeetCode209_false.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_7;
+package cn.whaifree.redo.redo.redo_24_1_7;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_1_7/LeetCode2487_false.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_7;
+package cn.whaifree.redo.redo.redo_24_1_7;
 
 import cn.whaifree.leetCode.model.ListNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_1_7/LeetCode287_false.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_7;
+package cn.whaifree.redo.redo.redo_24_1_7;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_1_7/LeetCode28_false.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_1_7;
+package cn.whaifree.redo.redo.redo_24_1_7;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_2_18/LeetCode131.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_18;
+package cn.whaifree.redo.redo.redo_24_2_18;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_2_22/LeetCode131.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_22;
+package cn.whaifree.redo.redo.redo_24_2_22;
 
 import org.junit.Test;
 import org.w3c.dom.ls.LSException;

src/main/java/cn/whaifree/redo/redo/redo_24_2_22/LeetCode206.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_22;
+package cn.whaifree.redo.redo.redo_24_2_22;
 
 import cn.whaifree.leetCode.model.ListNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_2_22/LeetCode222.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_22;
+package cn.whaifree.redo.redo.redo_24_2_22;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_2_22/LeetCode236.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_22;
+package cn.whaifree.redo.redo.redo_24_2_22;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_2_22/LeetCode40.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_22;
+package cn.whaifree.redo.redo.redo_24_2_22;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_2_22/LeetCode450.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_22;
+package cn.whaifree.redo.redo.redo_24_2_22;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_2_22/LeetCode46.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_22;
+package cn.whaifree.redo.redo.redo_24_2_22;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_2_22/LeetCode47.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_22;
+package cn.whaifree.redo.redo.redo_24_2_22;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_2_22/LeetCode491.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_22;
+package cn.whaifree.redo.redo.redo_24_2_22;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_2_22/LeetCode501.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_22;
+package cn.whaifree.redo.redo.redo_24_2_22;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_2_22/LeetCode90.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_22;
+package cn.whaifree.redo.redo.redo_24_2_22;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_2_4/LeetCode110.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_4;
+package cn.whaifree.redo.redo.redo_24_2_4;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_2_4/LeetCode203.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_4;
+package cn.whaifree.redo.redo.redo_24_2_4;
 
 import cn.whaifree.leetCode.model.ListNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_2_4/LeetCode206.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_4;
+package cn.whaifree.redo.redo.redo_24_2_4;
 
 import cn.whaifree.leetCode.model.ListNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_2_4/LeetCode216.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_4;
+package cn.whaifree.redo.redo.redo_24_2_4;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_2_4/LeetCode222.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_4;
+package cn.whaifree.redo.redo.redo_24_2_4;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_2_4/LeetCode236.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_4;
+package cn.whaifree.redo.redo.redo_24_2_4;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_2_4/LeetCode450.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_4;
+package cn.whaifree.redo.redo.redo_24_2_4;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_2_4/LeetCode501.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_4;
+package cn.whaifree.redo.redo.redo_24_2_4;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_2_4/LeetCode701.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_4;
+package cn.whaifree.redo.redo.redo_24_2_4;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_2_4/LeetCode77.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_2_4;
+package cn.whaifree.redo.redo.redo_24_2_4;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_1/LeetCode1005.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_1;
+package cn.whaifree.redo.redo.redo_24_3_1;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_1/LeetCode122.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_1;
+package cn.whaifree.redo.redo.redo_24_3_1;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_1/LeetCode134.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_1;
+package cn.whaifree.redo.redo.redo_24_3_1;
 
 import org.junit.Test;
 
@@ -12,7 +12,7 @@ public class LeetCode134 {
 
 
     public static void main(String[] args) {
-        
+
     }
 
     @Test

src/main/java/cn/whaifree/redo/redo/redo_24_3_1/LeetCode135.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_1;
+package cn.whaifree.redo.redo.redo_24_3_1;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_1/LeetCode376.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_1;
+package cn.whaifree.redo.redo.redo_24_3_1;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_1/LeetCode406.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_1;
+package cn.whaifree.redo.redo.redo_24_3_1;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_1/LeetCode45.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_1;
+package cn.whaifree.redo.redo.redo_24_3_1;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_1/LeetCode491.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_1;
+package cn.whaifree.redo.redo.redo_24_3_1;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_1/LeetCode51.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_1;
+package cn.whaifree.redo.redo.redo_24_3_1;
 
 
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_3_1/LeetCode53.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_1;
+package cn.whaifree.redo.redo.redo_24_3_1;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_1/LeetCode55.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_1;
+package cn.whaifree.redo.redo.redo_24_3_1;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_1/LeetCode860.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_1;
+package cn.whaifree.redo.redo.redo_24_3_1;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_16/LeetCode236.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_16;
+package cn.whaifree.redo.redo.redo_24_3_16;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_3_16/LeetCode343.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_16;
+package cn.whaifree.redo.redo.redo_24_3_16;
 
 /**
  * @version 1.0

src/main/java/cn/whaifree/redo/redo/redo_24_3_16/LeetCode376.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_16;
+package cn.whaifree.redo.redo.redo_24_3_16;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_16/LeetCode416.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_16;
+package cn.whaifree.redo.redo.redo_24_3_16;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_16/LeetCode435.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_16;
+package cn.whaifree.redo.redo.redo_24_3_16;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_16/LeetCode45.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_16;
+package cn.whaifree.redo.redo.redo_24_3_16;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_16/LeetCode738.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_16;
+package cn.whaifree.redo.redo.redo_24_3_16;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_16/LeetCode763.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_16;
+package cn.whaifree.redo.redo.redo_24_3_16;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_16/LeetCode96.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_16;
+package cn.whaifree.redo.redo.redo_24_3_16;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_16/LeetCode968.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_16;
+package cn.whaifree.redo.redo.redo_24_3_16;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_3_24/LCR001.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_24;
+package cn.whaifree.redo.redo.redo_24_3_24;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_24/LCR090.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_24;
+package cn.whaifree.redo.redo.redo_24_3_24;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_24/LeetCode005.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_24;
+package cn.whaifree.redo.redo.redo_24_3_24;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_24/LeetCode1049.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_24;
+package cn.whaifree.redo.redo.redo_24_3_24;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_24/LeetCode343.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_24;
+package cn.whaifree.redo.redo.redo_24_3_24;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_24/LeetCode416.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_24;
+package cn.whaifree.redo.redo.redo_24_3_24;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_24/LeetCode45.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_24;
+package cn.whaifree.redo.redo.redo_24_3_24;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_24/LeetCode647.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_24;
+package cn.whaifree.redo.redo.redo_24_3_24;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_24/LeetCode713.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_24;
+package cn.whaifree.redo.redo.redo_24_3_24;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_24/LeetCode738.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_24;
+package cn.whaifree.redo.redo.redo_24_3_24;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_24/LeetCode96.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_24;
+package cn.whaifree.redo.redo.redo_24_3_24;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_9/LeetCode134.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_9;
+package cn.whaifree.redo.redo.redo_24_3_9;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_9/LeetCode236.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_9;
+package cn.whaifree.redo.redo.redo_24_3_9;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_3_9/LeetCode376.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_9;
+package cn.whaifree.redo.redo.redo_24_3_9;
 
 /**
  * @version 1.0

src/main/java/cn/whaifree/redo/redo/redo_24_3_9/LeetCode435.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_9;
+package cn.whaifree.redo.redo.redo_24_3_9;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_9/LeetCode45.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_9;
+package cn.whaifree.redo.redo.redo_24_3_9;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_9/LeetCode450.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_9;
+package cn.whaifree.redo.redo.redo_24_3_9;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_3_9/LeetCode452.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_9;
+package cn.whaifree.redo.redo.redo_24_3_9;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_9/LeetCode509.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_9;
+package cn.whaifree.redo.redo.redo_24_3_9;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_9/LeetCode738.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_9;
+package cn.whaifree.redo.redo.redo_24_3_9;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_9/LeetCode763.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_9;
+package cn.whaifree.redo.redo.redo_24_3_9;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_3_9/LeetCode968.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_3_9;
+package cn.whaifree.redo.redo.redo_24_3_9;
 
 import cn.whaifree.leetCode.model.TreeNode;
 import org.junit.Test;

src/main/java/cn/whaifree/redo/redo/redo_24_4_1/LeetCode209.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_4_1;
+package cn.whaifree.redo.redo.redo_24_4_1;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_4_1/LeetCode2602.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_4_1;
+package cn.whaifree.redo.redo.redo_24_4_1;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_4_1/LeetCode279.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_4_1;
+package cn.whaifree.redo.redo.redo_24_4_1;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_4_1/LeetCode322.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_4_1;
+package cn.whaifree.redo.redo.redo_24_4_1;
 
 import org.junit.Test;
 

src/main/java/cn/whaifree/redo/redo/redo_24_4_1/LeetCode377.java

@@ -1,4 +1,4 @@
-package cn.whaifree.redo.redo_24_4_1;
+package cn.whaifree.redo.redo.redo_24_4_1;
 
 import org.junit.Test;