update: 添加问题“1317.将整数转换为两个无零整数的和”的代码和题解 (#1120)

* autumn2025: P团笔试

* docs(3459): en+jp(init) (#1117)

* word: en+jp (#1117)

close #1113

* feat(word): workers - logs/keyboard (1117) (#1118)

* clean: before to dev (#1117) (#1118)

* word: en+jp today 2025.09.08 (#1118)

* 1317: init (#1118)

* 1317: WA.cpp (#1118) - OMG - 笔误了

* 1317: AC.cpp+py | WA.go (#1118) - 又笔误了

cpp - AC,100.00%,85.32%
py - AC,100.00%,97.65%

* 1317: TLE.go (#1118)

* 1317: AC.go+java+rust (#1118)

go - AC,100.00%,21.43%
java - AC,100.00%,90.63%
rust - AC,100.00%,37.50%

* update: 添加问题“1317.将整数转换为两个无零整数的和”的代码和题解 (#1120)

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

* fileChange: try (#1118)(#1120)

* fileChange: rollback (#1118)(#1120)

最终的diff好像还是几乎整个文件

这是github上git diff的bug吗？ 或者说是权限问题？

---------

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

Author: LetMeFly666

Codes/1317-convert-integer-to-the-sum-of-two-no-zero-integers.cpp

@@ -0,0 +1,31 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-09-08 23:05:58
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-09-08 23:11:26
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+private:
+    inline bool ok(int n) {
+        while (n) {
+            if (n % 10 == 0) {
+                return false;
+            }
+            n /= 10;
+        }
+        return true;
+    }
+public:
+    vector<int> getNoZeroIntegers(int n) {
+        for (int i = 1; i < n; i++) {
+            if (ok(i) && ok(n - i)) {
+                return {i, n - i};
+            }
+        }
+        return {};  // FAKE RETURN
+    }
+};

Codes/1317-convert-integer-to-the-sum-of-two-no-zero-integers.go

@@ -0,0 +1,26 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-09-08 23:05:58
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-09-08 23:16:59
+ */
+package main
+
+func nonZero1317(n int) bool {
+    for n > 0 {
+        if n % 10 == 0 {
+            return false
+        }
+        n /= 10
+    }
+    return true
+}
+
+func getNoZeroIntegers(n int) (ans []int) {
+    for i := 1; i < n; i++ {
+        if nonZero1317(i) && nonZero1317(n - i) {
+            return []int{i, n - i}
+        }
+    }
+    return
+}

Codes/1317-convert-integer-to-the-sum-of-two-no-zero-integers.java

@@ -0,0 +1,26 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-09-08 23:05:58
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-09-08 23:19:08
+ */
+class Solution {
+    private boolean non0(int n) {
+        while (n > 0) {
+            if (n % 10 == 0) {
+                return false;
+            }
+            n /= 10;
+        }
+        return true;
+    }
+
+    public int[] getNoZeroIntegers(int n) {
+        for (int i = 1; i < n; i++) {
+            if (non0(i) && non0(n - i)) {
+                return new int[]{i, n - i};
+            }
+        }
+        return new int[]{};
+    }
+}

Codes/1317-convert-integer-to-the-sum-of-two-no-zero-integers.py

@@ -0,0 +1,14 @@
+'''
+Author: LetMeFly
+Date: 2025-09-08 23:05:58
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-09-08 23:13:48
+'''
+from typing import List
+
+class Solution:
+    def getNoZeroIntegers(self, n: int) -> List[int]:
+        for i in range(n):
+            if '0' not in str(i) and '0' not in str(n - i):
+                return [i, n - i]
+        return []  # FAKE RETURN

Codes/1317-convert-integer-to-the-sum-of-two-no-zero-integers.rs

@@ -0,0 +1,26 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-09-08 23:05:58
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-09-08 23:22:39
+ */
+impl Solution {
+    fn ok(mut n: i32) -> bool {
+        while n > 0 {
+            if n % 10 == 0 {
+                return false;
+            }
+            n /= 10
+        }
+        true
+    }
+    
+    pub fn get_no_zero_integers(n: i32) -> Vec<i32> {
+        for i in 1..n {
+            if Solution::ok(i) && Solution::ok(n - i) {
+                return vec![i, n - i];
+            }
+        }
+        vec![]
+    }
+}

Codes/lib.rs

@@ -2,7 +2,7 @@
  * @Author: LetMeFly
  * @Date: 2025-08-07 14:11:36
  * @LastEditors: LetMeFly.xyz
- * @LastEditTime: 2025-08-31 19:14:48
+ * @LastEditTime: 2025-09-07 23:24:39
  */
 pub struct Solution;
-include!("3027-find-the-number-of-ways-to-place-people-ii.rs");  // 这个fileName是会被脚本替换掉的
+include!("1317-convert-integer-to-the-sum-of-two-no-zero-integers.rs");  // 这个fileName是会被脚本替换掉的

Codes/meiTuan-Autumn2025-01.cpp

@@ -0,0 +1,25 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-09-06 10:17:35
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-09-06 10:18:48
+ */
+#include <iostream>
+#include <set>
+#include <unordered_set>
+using namespace std;
+
+int main() {
+    string s;
+    cin >> s;
+    unordered_set<string> se;
+    int last = 0;
+    for (int i = 0; i < s.size(); i++) {
+        if (s[i] == 'd') {
+            se.insert(s.substr(last, i - last));
+            last = i + 2;
+        }
+    }
+    cout << se.size() << endl;
+    return 0;
+}

Codes/meiTuan-Autumn2025-02.cpp

@@ -0,0 +1,66 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-09-06 10:23:00
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-09-06 10:39:29
+ */
+#include <iostream>
+#include <vector>
+#include <algorithm>
+using namespace std;
+using ll = long long;
+
+/*
+0 1 1 2
+   ⬇️
+0 1 2 1
+*/
+/*
+0 1 3 4
+0 1 - 后面无所谓了
+*/
+int main() {
+    int n;
+    cin >> n;
+    vector<ll> v;
+    for (int i = 0; i < n; i++) {
+        ll t;
+        cin >> t;
+        v.push_back(t);
+    }
+    sort(v.begin(), v.end());
+    ll ans = 0;
+    vector<ll> sorted;
+    vector<bool> used(n);
+    for (ll finding = 0, i = 0; i < n; i++) {
+        if (v[i] == finding) {
+            finding++;
+            used[i] = true;
+            sorted.push_back(v[i]);
+            while (i + 1 < n && v[i + 1] == v[i]) {
+                i++;
+                ans += finding;
+            }
+        }
+        ans += finding;
+        // printf("finding = %lld, i = %lld, ans = %lld\n", finding, i, ans);  //****
+    }
+    for (int i = 0; i < n; i++) {
+        if (!used[i]) {
+            sorted.push_back(v[i]);
+        }
+    }
+    cout << ans << endl;
+    for (int i = 0; i < n; i++) {
+        if (i) {
+            putchar(' ');
+        }
+        cout << sorted[i];
+    }
+    return 0;
+}
+
+/*
+3
+1 0 1
+*/

Codes/meiTuan-Autumn2025-02_try2.cpp

@@ -0,0 +1,82 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-09-06 10:23:00
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-09-06 10:53:00
+ */
+#include <iostream>
+#include <vector>
+#include <algorithm>
+using namespace std;
+using ll = long long;
+
+/*
+给定一个长度为n的数组v，可以重新排列数组。
+重新排列后，定义一个长度同样为n的数组b，b[i] = mex(v[0], v[1], ..., v[i])
+其中mex(v)表示v中没有出现过的最小非负整数。
+你需要最大化b中的元素之和，返回这个最大值，以及一个可能的a的重排方案。
+
+数据范围：1<=n<=10^5
+0<=v[i]<=10^9
+*/
+
+/*
+0 1 1 2
+   ⬇️
+0 1 2 1
+*/
+/*
+0 1 3 4
+0 1 - 后面无所谓了
+*/
+int main() {
+    int n;
+    cin >> n;
+    vector<ll> v;
+    for (int i = 0; i < n; i++) {
+        ll t;
+        cin >> t;
+        v.push_back(t);
+    }
+    sort(v.begin(), v.end());
+    vector<ll> sorted;
+    vector<bool> used(n);
+    for (ll finding = 0, i = 0; i < n; i++) {
+        if (v[i] == finding) {
+            finding++;
+            used[i] = true;
+            sorted.push_back(v[i]);
+            while (i + 1 < n && v[i + 1] == v[i]) {
+                i++;
+            }
+        } else {
+            break;
+        }
+    }
+    for (int i = 0; i < n; i++) {
+        if (!used[i]) {
+            sorted.push_back(v[i]);
+        }
+    }
+
+    ll ans = 0;
+    for (ll mini = 0, i = 0; i < n; i++) {
+        if (sorted[i] == mini) {
+            mini++;
+        }
+        ans += mini;
+    }
+    cout << ans << endl;
+    for (int i = 0; i < n; i++) {
+        if (i) {
+            putchar(' ');
+        }
+        cout << sorted[i];
+    }
+    return 0;
+}
+
+/*
+3
+1 0 1
+*/