合并所有的solution

Author: JavaScalaDeveloper

basic/sorting/BubbleSort/README.md

@@ -6,8 +6,6 @@
 
 ## 代码示例
 
-<!-- tabs:start -->
-
 ### **Java**
 
 ```java
@@ -42,32 +40,6 @@ public class BubbleSort {
 }
 ```
 
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-### **Python3**
-
-
-
-
-
 ## 算法分析
 
 空间复杂度 $O(1)$、时间复杂度 $O(n^2)$。

basic/sorting/CountingSort/README.md

@@ -12,8 +12,6 @@
 
 ## 代码示例
 
-<!-- tabs:start -->
-
 ### **Java**
 
 ```java
@@ -36,12 +34,6 @@ public static void sort(int[] nums, int min, int max) {
 }
 ```
 
-
-
-
-
-
-
 ## 算法分析
 
 -   时间复杂度 $O(n+k)$， 其中 $n$ 为排序数组长度，而 $k$ 为排序数组中数值的取值范围，当 $k\lt n$ 时，时间复杂度为 $O(n)$。

basic/sorting/HeapSort/README.md

@@ -69,12 +69,6 @@ for (int i = n / 2; i > 0; --i) {
 
 ## 代码实现
 
-<!-- tabs:start -->
-
-### **Python3**
-
-
-
 ### **Java**
 
 ```java
@@ -129,13 +123,3 @@ public class Main {
     }
 }
 ```
-
-
-
-
-
-
-
-
-
-

basic/sorting/InsertionSort/README.md

@@ -15,8 +15,6 @@
 
 ## 代码示例
 
-<!-- tabs:start -->
-
 ### **Java**
 
 ```java
@@ -42,32 +40,6 @@ public class InsertionSort {
 }
 ```
 
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-### **Python3**
-
-
-
-
-
 ## 算法分析
 
 空间复杂度 $O(1)$，时间复杂度 $O(n^2)$。

basic/sorting/MergeSort/README.md

@@ -71,12 +71,6 @@ void mergeSort(int[] nums, int left, int right) {
 
 ## 代码实现
 
-<!-- tabs:start -->
-
-### **Python3**
-
-
-
 ### **Java**
 
 ```java
@@ -125,21 +119,3 @@ public class Main {
     }
 }
 ```
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-

basic/sorting/QuickSort/README.md

@@ -62,12 +62,6 @@ void quickSort(int[] nums, int left, int right) {
 
 ## 代码实现
 
-<!-- tabs:start -->
-
-### **Python3**
-
-
-
 ### **Java**
 
 ```java
@@ -109,21 +103,3 @@ public class Main {
     }
 }
 ```
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-

basic/sorting/SelectionSort/README.md

@@ -4,8 +4,6 @@
 
 ## 代码示例
 
-<!-- tabs:start -->
-
 ### **Java**
 
 ```java
@@ -39,32 +37,6 @@ public class SelectionSort {
 }
 ```
 
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-### **Python3**
-
-
-
-
-
 ## 算法分析
 
 空间复杂度 $O(1)$，时间复杂度 $O(n^2)$。

basic/sorting/ShellSort/README.md

@@ -9,8 +9,6 @@
 
 ## 代码示例
 
-<!-- tabs:start -->
-
 ### **Java**
 
 ```java
@@ -41,20 +39,6 @@ public class ShellSort {
 }
 ```
 
-
-
-
-
-
-
-
-
-
-
-
-
-
-
 ## 算法分析
 
 时间复杂度：

change/scripts/Main.java

@@ -0,0 +1,35 @@
+package change.scripts;
+
+import java.io.IOException;
+
+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();
+        }
+
+
+//        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);
+        }
+
+
+    }
+}

change/scripts/MergeMdFiles.java

@@ -0,0 +1,43 @@
+package change.scripts;
+
+import java.io.*;
+
+public class MergeMdFiles {
+
+    public static void main(String[] args) throws IOException {
+        String directory = "D:\\WorkSpaces\\leetcode-all\\solution"; // 修改为目录路径
+        String outputFile = "D:\\WorkSpaces\\leetcode-all\\change\\scripts\\out\\output-file.md"; // 修改为输出文件路径
+
+        File dir = new File(directory);
+        if (!dir.exists() || !dir.isDirectory()) {
+            System.out.println("目录不存在或者不是一个目录");
+            return;
+        }
+
+        FileOutputStream fos = new FileOutputStream(outputFile);
+        mergeMdFiles(dir, fos);
+        fos.close();
+    }
+
+    private static void mergeMdFiles(File dir, OutputStream os) throws IOException {
+        File[] files = dir.listFiles();
+        for (File file : files) {
+            if (file.isDirectory()) {
+                mergeMdFiles(file, os);
+            } else if (file.isFile() && file.getName().endsWith(".md")) {
+                FileInputStream fis = new FileInputStream(file);
+                copy(fis, os);
+                fis.close();
+            }
+        }
+    }
+
+    private static void copy(InputStream is, OutputStream os) throws IOException {
+        byte[] buffer = new byte[4096];
+        int len;
+        while ((len = is.read(buffer)) != -1) {
+            os.write(buffer, 0, len);
+        }
+    }
+
+}