feat: add solutions to lc problem: No.1323

No.1323.Maximum 69 Number

Author: yanglbme

solution/1300-1399/1323.Maximum 69 Number/README.md

@@ -58,15 +58,58 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def maximum69Number(self, num: int) -> int:
+        return int(str(num).replace("6", "9", 1))
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int maximum69Number(int num) {
+        return Integer.valueOf(String.valueOf(num).replaceFirst("6", "9"));
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int maximum69Number(int num) {
+        string s = to_string(num);
+        for (char& ch: s)
+        {
+            if (ch == '6')
+            {
+                ch = '9';
+                break;
+            }
+        }
+        return stoi(s);
+    }
+};
+```
 
+### **Go**
+
+```go
+func maximum69Number(num int) int {
+	s := strconv.Itoa(num)
+	nums := []byte(s)
+	for i, ch := range nums {
+		if ch == '6' {
+			nums[i] = '9'
+			break
+		}
+	}
+	ans, _ := strconv.Atoi(string(nums))
+	return ans
+}
 ```
 
 ### **...**

solution/1300-1399/1323.Maximum 69 Number/README_EN.md

@@ -53,13 +53,56 @@ The maximum number is 9969.
 ### **Python3**
 
 ```python
-
+class Solution:
+    def maximum69Number(self, num: int) -> int:
+        return int(str(num).replace("6", "9", 1))
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int maximum69Number(int num) {
+        return Integer.valueOf(String.valueOf(num).replaceFirst("6", "9"));
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int maximum69Number(int num) {
+        string s = to_string(num);
+        for (char& ch: s)
+        {
+            if (ch == '6')
+            {
+                ch = '9';
+                break;
+            }
+        }
+        return stoi(s);
+    }
+};
+```
 
+### **Go**
+
+```go
+func maximum69Number(num int) int {
+	s := strconv.Itoa(num)
+	nums := []byte(s)
+	for i, ch := range nums {
+		if ch == '6' {
+			nums[i] = '9'
+			break
+		}
+	}
+	ans, _ := strconv.Atoi(string(nums))
+	return ans
+}
 ```
 
 ### **...**

solution/1300-1399/1323.Maximum 69 Number/Solution.cpp

@@ -0,0 +1,15 @@
+class Solution {
+public:
+    int maximum69Number(int num) {
+        string s = to_string(num);
+        for (char& ch: s)
+        {
+            if (ch == '6')
+            {
+                ch = '9';
+                break;
+            }
+        }
+        return stoi(s);
+    }
+};

solution/1300-1399/1323.Maximum 69 Number/Solution.go

@@ -0,0 +1,12 @@
+func maximum69Number(num int) int {
+	s := strconv.Itoa(num)
+	nums := []byte(s)
+	for i, ch := range nums {
+		if ch == '6' {
+			nums[i] = '9'
+			break
+		}
+	}
+	ans, _ := strconv.Atoi(string(nums))
+	return ans
+}

solution/1300-1399/1323.Maximum 69 Number/Solution.java

@@ -0,0 +1,5 @@
+class Solution {
+    public int maximum69Number(int num) {
+        return Integer.valueOf(String.valueOf(num).replaceFirst("6", "9"));
+    }
+}

solution/1300-1399/1323.Maximum 69 Number/Solution.py

@@ -0,0 +1,3 @@
+class Solution:
+    def maximum69Number(self, num: int) -> int:
+        return int(str(num).replace("6", "9", 1))

solution/1800-1899/1885.Count Pairs in Two Arrays/README.md

@@ -1,4 +1,4 @@
-# [1885. ](https://leetcode.cn/problems/count-pairs-in-two-arrays)
+# [1885. 统计数对](https://leetcode.cn/problems/count-pairs-in-two-arrays)
 
 [English Version](/solution/1800-1899/1885.Count%20Pairs%20in%20Two%20Arrays/README_EN.md)
 

solution/README.md

@@ -197,17 +197,17 @@ def save(result):
 
 
 if __name__ == '__main__':
-    # cookie_cn = ''
-    # cookie_en = ''
-    # spider = Spider(cookie_cn, cookie_en)
-    # res = spider.run()
-    # save(res)
+    cookie_cn = ''
+    cookie_en = ''
+    spider = Spider(cookie_cn, cookie_en)
+    res = spider.run()
+    save(res)
 
     with open('./result.json', 'r', encoding='utf-8') as f:
         res = f.read()
         res = json.loads(res)
 
-    # generate_readme(res)
-    # generate_question_readme(res)
-    # generate_summary(res)
-    refresh(res)
+    generate_readme(res)
+    generate_question_readme(res)
+    generate_summary(res)
+    # refresh(res)