update: 添加问题“1323.6和9组成的最大数字”的代码和题解 (#1085)

Signed-off-by: LetMeFly666 <[email protected]>

Author: LetMeFly666

.commitmsg

@@ -0,0 +1,23 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-16 10:17:15
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-16 10:19:20
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int maximum69Number (int num) {
+        string s = to_string(num);
+        for (char &c : s) {
+            if (c == '6') {
+                c = '9';
+                break;  // 记得break
+            }
+        }
+        return atoi(s.c_str());
+    }
+};

Codes/1323-maximum-69-number.cpp

@@ -0,0 +1,19 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-16 10:17:15
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-16 10:43:00
+ */
+package main
+
+import (
+    "strconv"
+    "strings"
+)
+
+func maximum69Number (num int) (ans int) {
+    s := strconv.Itoa(num)
+    s = strings.Replace(s, "6", "9", 1)
+    ans, _ = strconv.Atoi(s)
+    return
+}

Codes/1323-maximum-69-number.go

@@ -0,0 +1,11 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-16 10:17:15
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-16 10:46:36
+ */
+class Solution {
+    public int maximum69Number (int num) {
+        return Integer.parseInt(String.valueOf(num).replaceFirst("6", "9"));  // java竟然一行解决了
+    }
+}

Codes/1323-maximum-69-number.java

@@ -0,0 +1,14 @@
+'''
+Author: LetMeFly
+Date: 2025-08-16 10:17:15
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-08-16 10:24:13
+'''
+class Solution:
+    def maximum69Number (self, num: int) -> int:
+        s = list(str(num))
+        for i, c in enumerate(s):
+            if c == '6':
+                s[i] = '9'
+                break
+        return int(''.join(s))  # 记得转回int

Codes/1323-maximum-69-number.py

@@ -0,0 +1,11 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-16 10:17:15
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-16 10:48:36
+ */
+impl Solution {
+    pub fn maximum69_number (num: i32) -> i32 {
+        num.to_string().replacen("6", "9", 1).parse().unwrap()
+    }
+}

Codes/1323-maximum-69-number.rs

@@ -0,0 +1,22 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-16 10:17:15
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-16 10:34:19
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int maximum69Number (int num) {
+        int base = 0;
+        for (int n = num, loc = 0, nowPow = 1; n; n /= 10, loc++, nowPow *= 10) {
+            if (n % 10 == 6) {
+                base = nowPow;
+            }
+        }
+        return num + base * 3;
+    }
+};

Codes/1323-maximum-69-number_noString-better.cpp

@@ -0,0 +1,25 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-16 10:17:15
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-16 10:30:45
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int maximum69Number (int num) {
+        int first6loc = -1;
+        for (int n = num, loc = 0; n; n /= 10, loc++) {
+            if (n % 10 == 6) {
+                first6loc = loc;
+            }
+        }
+        if (first6loc == -1) {
+            return num;
+        }
+        return num + 3 * pow(10, first6loc);
+    }
+};

Codes/1323-maximum-69-number_noString-step1.cpp

@@ -5,4 +5,4 @@
  * @LastEditTime: 2025-08-11 22:07:08
  */
 pub struct Solution;
-include!("0342-power-of-four_20250815.rs");  // 这个fileName是会被脚本替换掉的
+include!("1323-maximum-69-number.rs");  // 这个fileName是会被脚本替换掉的

Codes/lib.rs

@@ -514,6 +514,7 @@
 |1295.统计位数为偶数的数字|简单|<a href="https://leetcode.cn/problems/find-numbers-with-even-number-of-digits/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/30/LeetCode%201295.%E7%BB%9F%E8%AE%A1%E4%BD%8D%E6%95%B0%E4%B8%BA%E5%81%B6%E6%95%B0%E7%9A%84%E6%95%B0%E5%AD%97/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147637587" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-numbers-with-even-number-of-digits/solutions/3666390/letmefly-1295tong-ji-wei-shu-wei-ou-shu-bwhfr/" target="_blank">LeetCode题解</a>|
 |1299.将每个元素替换为右侧最大元素|简单|<a href="https://leetcode.cn/problems/replace-elements-with-greatest-element-on-right-side/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/02/16/LeetCode%201299.%E5%B0%86%E6%AF%8F%E4%B8%AA%E5%85%83%E7%B4%A0%E6%9B%BF%E6%8D%A2%E4%B8%BA%E5%8F%B3%E4%BE%A7%E6%9C%80%E5%A4%A7%E5%85%83%E7%B4%A0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/145661909" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/replace-elements-with-greatest-element-on-right-side/solutions/3076497/letmefly-1299jiang-mei-ge-yuan-su-ti-hua-4y58/" target="_blank">LeetCode题解</a>|
 |1302.层数最深叶子节点的和|中等|<a href="https://leetcode.cn/problems/deepest-leaves-sum/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/08/17/LeetCode%201302.%E5%B1%82%E6%95%B0%E6%9C%80%E6%B7%B1%E5%8F%B6%E5%AD%90%E8%8A%82%E7%82%B9%E7%9A%84%E5%92%8C/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126377912" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/deepest-leaves-sum/solution/letmefly-1302ceng-shu-zui-shen-xie-zi-ji-eyu0/" target="_blank">LeetCode题解</a>|
+|1323.6和9组成的最大数字|简单|<a href="https://leetcode.cn/problems/maximum-69-number/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/08/16/LeetCode%201323.6%E5%92%8C9%E7%BB%84%E6%88%90%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E5%AD%97/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/150443019" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-69-number/solutions/3754470/letmefly-13236-he-9-zu-cheng-de-zui-da-s-hqw5/" target="_blank">LeetCode题解</a>|
 |1328.破坏回文串|中等|<a href="https://leetcode.cn/problems/break-a-palindrome/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/03/05/LeetCode%201328.%E7%A0%B4%E5%9D%8F%E5%9B%9E%E6%96%87%E4%B8%B2/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/146046025" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/break-a-palindrome/solutions/3597648/letmefly-1328po-pi-hui-wen-chuan-tan-xin-ktbc/" target="_blank">LeetCode题解</a>|
 |1329.将矩阵按对角线排序|中等|<a href="https://leetcode.cn/problems/sort-the-matrix-diagonally/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/04/29/LeetCode%201329.%E5%B0%86%E7%9F%A9%E9%98%B5%E6%8C%89%E5%AF%B9%E8%A7%92%E7%BA%BF%E6%8E%92%E5%BA%8F/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/138329644" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/sort-the-matrix-diagonally/solutions/2761288/letmefly-1329jiang-ju-zhen-an-dui-jiao-x-nu18/" target="_blank">LeetCode题解</a>|
 |1331.数组序号转换|简单|<a href="https://leetcode.cn/problems/rank-transform-of-an-array/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/07/28/LeetCode%201331.%E6%95%B0%E7%BB%84%E5%BA%8F%E5%8F%B7%E8%BD%AC%E6%8D%A2/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126030218" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/rank-transform-of-an-array/solution/letmefly-1331shu-zu-xu-hao-zhuan-huan-by-p3j3/" target="_blank">LeetCode题解</a>|