feat: add solutions to lc problem: No.0937

No.0937.Reorder Data in Log Files

Author: yanglbme

solution/0900-0999/0937.Reorder Data in Log Files/README.md

@@ -59,22 +59,50 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：自定义排序**
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
+class Solution:
+    def reorderLogFiles(self, logs: List[str]) -> List[str]:
+        def cmp(x):
+            a, b = x.split(' ', 1)
+            return (0, b, a) if b[0].isalpha() else (1,)
 
+        return sorted(logs, key=cmp)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public String[] reorderLogFiles(String[] logs) {
+        Arrays.sort(logs, this::cmp);
+        return logs;
+    }
 
+    private int cmp(String a, String b) {
+        String[] t1 = a.split(" ", 2);
+        String[] t2 = b.split(" ", 2);
+        boolean d1 = Character.isDigit(t1[1].charAt(0));
+        boolean d2 = Character.isDigit(t2[1].charAt(0));
+        if (!d1 && !d2) {
+            int v = t1[1].compareTo(t2[1]);
+            return v == 0 ? t1[0].compareTo(t2[0]) : v;
+        }
+        if (d1 && d2) {
+            return 0;
+        }
+        return d1 ? 1 : -1;
+    }
+}
 ```
 
 ### **TypeScript**

solution/0900-0999/0937.Reorder Data in Log Files/README_EN.md

@@ -58,13 +58,39 @@ The digit-logs have a relative order of "dig1 8 1 5 1", "dig2 3 6
 ### **Python3**
 
 ```python
+class Solution:
+    def reorderLogFiles(self, logs: List[str]) -> List[str]:
+        def cmp(x):
+            a, b = x.split(' ', 1)
+            return (0, b, a) if b[0].isalpha() else (1,)
 
+        return sorted(logs, key=cmp)
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public String[] reorderLogFiles(String[] logs) {
+        Arrays.sort(logs, this::cmp);
+        return logs;
+    }
 
+    private int cmp(String a, String b) {
+        String[] t1 = a.split(" ", 2);
+        String[] t2 = b.split(" ", 2);
+        boolean d1 = Character.isDigit(t1[1].charAt(0));
+        boolean d2 = Character.isDigit(t2[1].charAt(0));
+        if (!d1 && !d2) {
+            int v = t1[1].compareTo(t2[1]);
+            return v == 0 ? t1[0].compareTo(t2[0]) : v;
+        }
+        if (d1 && d2) {
+            return 0;
+        }
+        return d1 ? 1 : -1;
+    }
+}
 ```
 
 ### **TypeScript**

solution/0900-0999/0937.Reorder Data in Log Files/Solution.java

@@ -0,0 +1,21 @@
+class Solution {
+    public String[] reorderLogFiles(String[] logs) {
+        Arrays.sort(logs, this::cmp);
+        return logs;
+    }
+
+    private int cmp(String a, String b) {
+        String[] t1 = a.split(" ", 2);
+        String[] t2 = b.split(" ", 2);
+        boolean d1 = Character.isDigit(t1[1].charAt(0));
+        boolean d2 = Character.isDigit(t2[1].charAt(0));
+        if (!d1 && !d2) {
+            int v = t1[1].compareTo(t2[1]);
+            return v == 0 ? t1[0].compareTo(t2[0]) : v;
+        }
+        if (d1 && d2) {
+            return 0;
+        }
+        return d1 ? 1 : -1;
+    }
+}

solution/0900-0999/0937.Reorder Data in Log Files/Solution.py

@@ -0,0 +1,7 @@
+class Solution:
+    def reorderLogFiles(self, logs: List[str]) -> List[str]:
+        def cmp(x):
+            a, b = x.split(' ', 1)
+            return (0, b, a) if b[0].isalpha() else (1,)
+
+        return sorted(logs, key=cmp)