docs: 柠檬微趣笔试题(#818)

close #818

* rename 周报

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

Author: LetMeFly666

.commitmsg

@@ -0,0 +1,33 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-16 23:04:54
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-16 23:33:11
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    void nextPermutation(vector<int>& nums) {
+        int i = nums.size() - 1;
+        for (; i > 0; i--) {
+            if (nums[i] > nums[i - 1]) {
+                break;
+            }
+        }
+        cout << i << endl;
+        if (!i) {
+            reverse(nums.begin(), nums.end());
+            return;
+        }
+        i--;
+        int j = nums.size();
+        while (nums[--j] <= nums[i]) {
+            cout << j << (nums[j] <= nums[i]) << endl;
+        };
+        swap(nums[i], nums[j]);
+        reverse(nums.begin() + i + 1, nums.end());
+    }
+};

Codes/0031-next-permutation_20250316.cpp

@@ -0,0 +1,63 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-16 22:52:13
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-16 22:53:13
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+private:
+    vector<string> s2v(string s) {
+        vector<string> ans;
+        int last = -1;
+        for (int i = 0; i <= s.size(); i++) {
+            if (i == s.size() || s[i] == ' ') {
+                string thisStr = s.substr(last + 1, i - last - 1);
+                if (thisStr.size()) {
+                    ans.push_back(thisStr);
+                }
+                last = i;
+            }
+        }
+        return ans;
+    }
+public:
+    /**
+     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
+     *
+     * 
+     * @param pattern string字符串 
+     * @param str string字符串 
+     * @return bool布尔型
+     */
+    bool wordPattern(string pattern, string str) {
+        // write code here
+        unordered_map<char, string> p2s;
+        unordered_map<string, char> s2p;
+        vector<string> v = s2v(str);
+        if (pattern.size() != v.size()) {
+            return false;
+        }
+        for (int i = 0; i < v.size(); i++) {
+            if (p2s.count(pattern[i])) {
+                if (p2s[pattern[i]] != v[i]) {
+                    return false;
+                }
+            } else {
+                p2s[pattern[i]] = v[i];
+            }
+
+            if (s2p.count(v[i])) {
+                if (s2p[v[i]] != pattern[i]) {
+                    return false;
+                }
+            } else {
+                s2p[v[i]] = pattern[i];
+            }
+        }
+        return true;
+    }
+};

Codes/NingMengWeiQu-20250316-01-After.cpp

@@ -0,0 +1,51 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-16 20:52:35
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-16 20:52:36
+ */
+#include <unordered_map>
+class Solution {
+private:
+    vector<string> s2v(string s) {
+        vector<string> ans;
+        int last = -1;
+        for (int i = 0; i <= s.size(); i++) {
+            if (i == s.size() || s[i] == ' ') {
+                string thisStr = s.substr(last + 1, i - last - 1);
+                if (thisStr.size()) {
+                    ans.push_back(thisStr);
+                }
+                last = i;
+            }
+        }
+        return ans;
+    }
+public:
+    /**
+     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
+     *
+     * 
+     * @param pattern string字符串 
+     * @param str string字符串 
+     * @return bool布尔型
+     */
+    bool testMatch(string pattern, string str) {
+        // write code here
+        unordered_map<char, string> ma;
+        vector<string> v = s2v(str);
+        if (pattern.size() != v.size()) {
+            return false;
+        }
+        for (int i = 0; i < v.size(); i++) {
+            if (ma.count(pattern[i])) {
+                if (ma[pattern[i]] != v[i]) {
+                    return false;
+                }
+            } else {
+                ma[pattern[i]] = v[i];
+            }
+        }
+        return true;
+    }
+};

Codes/NingMengWeiQu-20250316-01-BiShiShi.cpp

@@ -0,0 +1,76 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-16 21:01:38
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-16 23:43:37
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+typedef long long ll;
+class Solution {
+private:
+    string itos(int n) {
+        string s;
+        while (n) {
+            s = char('0' + n % 10) + s;
+            n /= 10;
+        }
+        return s;
+    }
+
+    ll stoi(string s) {
+        ll ans = 0;
+        for (char c : s) {
+            ans = ans * 10 + c - '0';
+        }
+        return ans;
+    }
+public:
+    /**
+     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
+     *
+     * 
+     * @param N int整型 
+     * @return int整型
+
+     12334
+     12343
+
+     12343
+     12433
+
+     1235
+     */
+    int nextGreaterElement(int N) {
+        // write code here
+        string s = itos(N);
+        int last = -1;
+        for (int i = 1; i < s.size(); i++) {
+            if (s[i] > s[i - 1]) {
+                last = i - 1;
+            }
+        }
+        if (last == -1) {
+            return -1;
+        }
+        cout << last << endl;
+        int j = s.size() - 1;
+        for (; ; j--) {
+            if (s[j] > s[last]) {
+                break;
+            }
+        }
+        swap(s[last], s[j]);
+        // cout << s << endl;
+        reverse(s.begin() + last + 1, s.end());
+        // cout << s << endl;
+        ll ans = stoi(s);
+        cout << ans << endl;
+        if (ans > INT_MAX) {
+            return -1;
+        }
+        return ans;
+    }
+};

Codes/NingMengWeiQu-20250316-02-AfterBiShi-After02.cpp

@@ -0,0 +1,66 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-16 21:01:38
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-16 21:01:59
+ */
+#include <string>
+typedef long long ll;
+class Solution {
+private:
+    string itos(int n) {
+        string s;
+        while (n) {
+            s = char('0' + n % 10) + s;
+            n /= 10;
+        }
+        return s;
+    }
+
+    ll stoi(string s) {
+        ll ans = 0;
+        for (char c : s) {
+            ans = ans * 10 + c - '0';
+        }
+        return ans;
+    }
+public:
+    /**
+     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
+     *
+     * 
+     * @param N int整型 
+     * @return int整型
+
+     12334
+     12343
+
+     12343
+     12433
+
+     1235
+     */
+    int nextGreaterElement(int N) {
+        // write code here
+        string s = itos(N);
+        int last = -1;
+        for (int i = 1; i < s.size(); i++) {
+            if (s[i] > s[i - 1]) {
+                last = i;
+            }
+        }
+        if (last == -1) {
+            return -1;
+        }
+        swap(s[last], s[last - 1]);
+        // cout << s << endl;
+        sort(s.begin() + last, s.end());
+        // cout << s << endl;
+        ll ans = stoi(s);
+        cout << ans << endl;
+        if (ans > INT_MAX) {
+            return -1;
+        }
+        return ans;
+    }
+};

Codes/NingMengWeiQu-20250316-02-AfterBiShi-Change01.cpp

@@ -0,0 +1,58 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-16 20:53:22
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-16 20:53:22
+ */
+#include <string>
+class Solution {
+private:
+    string itos(int n) {
+        string s;
+        while (n) {
+            s = char('a' + n % 10) + s;
+            n /= 10;
+        }
+        return s;
+    }
+
+    int stoi(string s) {
+        int ans = 0;
+        for (char c : s) {
+            ans = ans * 10 + c - 'a';
+        }
+        return ans;
+    }
+public:
+    /**
+     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
+     *
+     * 
+     * @param N int整型 
+     * @return int整型
+
+     12334
+     12343
+
+     12343
+     12433
+
+     1235
+     */
+    int findGreaterNum(int N) {
+        // write code here
+        string s = itos(N);
+        int last = -1;
+        for (int i = 1; i < s.size(); i++) {
+            if (s[i] > s[i - 1]) {
+                last = i;
+            }
+        }
+        if (last == -1) {
+            return -1;
+        }
+        swap(s[last], s[last - 1]);
+        sort(s.begin() + last + 1, s.end());
+        return stoi(s);
+    }
+};