update: 添加问题“2643.一最多的行”的代码和题解(#830)

docs: en&jp words(2 days)

codes: 美团笔试 - WA版本
美团笔试最后思路想出来了但是没实现出来

docs: 美团笔试 - 题解(Half版)

backup: 防止脚本清除此行
|牛客-美团暑期2025-20250322-前两题和第三题的思路|<a href="https://blog.letmefly.xyz/2025/03/22/Nowcoder-MeiTuan-Summer2025-20250322/">本平台题解</a>|<a href="https://letmefly.blog.csdn.net/article/details/146448313">CSDN题解</a>|

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

Author: LetMeFly666

.commitmsg

@@ -0,0 +1,11 @@
+docs: en&jp words(2 days)
+
+codes: 美团笔试 - WA版本
+美团笔试最后思路想出来了但是没实现出来
+
+docs: 美团笔试 - 题解(Half版)
+
+backup: 防止脚本清除此行
+|牛客-美团暑期2025-20250322-前两题和第三题的思路|<a href="https://blog.letmefly.xyz/2025/03/22/Nowcoder-MeiTuan-Summer2025-20250322/">本平台题解</a>|<a href="https://letmefly.blog.csdn.net/article/details/146448313">CSDN题解</a>|
+
+close: #829

Codes/2643-row-with-maximum-ones.cpp

@@ -0,0 +1,27 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-22 22:42:28
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-22 22:43:30
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    vector<int> rowAndMaximumOnes(vector<vector<int>>& mat) {
+        int mx = 0, ans = 0;
+        for (int i = 0; i < mat.size(); i++) {
+            int cnt = 0;
+            for (int j = 0; j < mat[i].size(); j++) {
+                cnt += mat[i][j];
+            }
+            if (cnt > mx) {
+                mx = cnt;
+                ans = i;
+            }
+        }
+        return {ans, mx};
+    }
+};

Codes/2643-row-with-maximum-ones.go

@@ -0,0 +1,21 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-22 22:51:01
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-22 22:52:04
+ */
+package main
+
+func rowAndMaximumOnes(mat [][]int) []int {
+    ans, mx := 0, 0
+    for i := range mat {
+        cnt := 0
+        for _, t := range mat[i] {
+            cnt += t
+        }
+        if cnt > mx {
+            ans, mx = i, cnt
+        }
+    }
+    return []int{ans, mx}
+}

Codes/2643-row-with-maximum-ones.java

@@ -0,0 +1,22 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-22 22:49:36
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-22 22:50:36
+ */
+class Solution {
+    public int[] rowAndMaximumOnes(int[][] mat) {
+        int ans = 0, mx = 0;
+        for (int i = 0; i < mat.length; i++) {
+            int cnt = 0;
+            for (int j = 0; j < mat[i].length; j++) {
+                cnt += mat[i][j];
+            }
+            if (cnt > mx) {
+                mx = cnt;
+                ans = i;
+            }
+        }
+        return new int[]{ans, mx};
+    }
+}

Codes/2643-row-with-maximum-ones.py

@@ -0,0 +1,16 @@
+'''
+Author: LetMeFly
+Date: 2025-03-22 22:44:18
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-03-22 22:44:32
+'''
+from typing import List
+
+class Solution:
+    def rowAndMaximumOnes(self, mat: List[List[int]]) -> List[int]:
+        mx, ans = 0, 0
+        for i in range(len(mat)):
+            cnt = sum(mat[i])
+            if cnt > mx:
+                mx, ans = cnt, i
+        return [ans, mx]

Codes/MeiTuan-Summer2025-01.cpp

@@ -0,0 +1,65 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-22 19:14:07
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-22 19:25:02
+ */
+#include <bits/stdc++.h>
+using namespace std;
+
+inline bool isOk(char c) {
+    static const string okList = "AHIMOTUVWXY";
+    for (char ok : okList) {
+        if (c == ok) {
+            return true;
+        }
+    }
+    return false;
+}
+
+bool isOk(string s) {
+    for (char c : s) {
+        if (!isOk(c)) {
+            return false;
+        }
+    }
+    for (int i = 0; i < s.size() / 2; i++) {
+        if (s[i] != s[s.size() - i - 1]) {
+            return false;
+        }
+    }
+    return true;
+}
+
+int solve(string s) {
+    int ans = 0;
+    for (int i = 0; i < s.size(); i++) {
+        for (int j = i + 1; j < s.size(); j++) {  // 长度大于1
+            bool thisIsOk = isOk(s.substr(i, j - i + 1));
+            ans += thisIsOk;
+            #ifdef _WIN32
+                if (thisIsOk) {
+                    printf("i = %d, j = %d, s.substr(%d, %d) = %s : OK\n", i, j, i, j, s.substr(i, j).c_str());
+                }
+            #endif
+        }
+    }
+    return ans;
+}
+
+int main() {
+#ifdef _WIN32
+    vector<string> S = {"AHHAMTT"};
+    vector<int> ANS = {3};
+    for (int i = 0; i < S.size(); i++) {
+        int ans = solve(S[i]);
+        cout << S[i] << ": " << ans << endl;
+        assert(ans == ANS[i]);
+    }
+#else
+    string s;
+    cin >> s;
+    cout << solve(s) << endl;
+#endif
+    return 0;
+}

Codes/MeiTuan-Summer2025-02.cpp

@@ -0,0 +1,48 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-22 19:30:14
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-22 19:36:56
+ */
+// 诶，不是哥们，还没利用“排列中数各不相同的性质”呢，咋就84ms然后AC了
+#include <bits/stdc++.h>
+using namespace std;
+
+int a[10010];
+
+int solve(int n) {
+    int ans = 0;
+    for (int start = 0; start < n; start++) {
+        int lt = 0, gt = 0;
+        ans++;
+        for (int i = 1; start - i >= 0 && start + i < n; i++) {
+            if (a[start - i] > a[start]) {
+                gt++;
+            } else {
+                lt++;
+            }
+            if (a[start + i] > a[start]) {
+                gt++;
+            } else {
+                lt++;
+            }
+            ans += lt == gt;
+        }
+    }
+    return ans;
+}
+
+int main() {
+    int T;
+    scanf("%d", &T);
+    while (T--) {
+        int n;
+        scanf("%d", &n);
+        for (int i = 0; i < n; i++) {
+            scanf("%d", &a[i]);
+        }
+        int ans = solve(n);
+        printf("%d\n", ans);
+    }
+    return 0;
+}

Codes/MeiTuan-Summer2025-03-01-FirstTry-Wa-看错题了.cpp

@@ -0,0 +1,50 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-22 19:40:10
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-22 19:44:01
+ */
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int n, k;
+
+inline int update(int now) {
+    if (now < 1) {
+        return 1;
+    }
+    if (now > n) {
+        return n;
+    }
+    return now;
+}
+
+int main() {
+    cin >> n >> k;
+    string s;
+    cin >> s;
+    int l = k, r = k;
+    // int ans = 0;
+    for (char c : s) {
+        if (c == 'L') {
+            l = update(l - 1);
+            r = update(r - 1);
+        } else if (c == 'R') {
+            l = update(l + 1);
+            r = update(r + 1);
+        } else {
+            l = update(l - 1);
+            r = update(r + 1);
+        }
+        // ans += l == 1 || r == n;
+        if (l == 1 || r == n) {
+            putchar('1');
+        } else {
+            putchar('0');
+        }
+    }
+    // cout << ans << endl;
+    puts("");
+    return 0;
+}

Codes/MeiTuan-Summer2025-03-02-先暴力-0分.cpp

@@ -0,0 +1,47 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-22 19:46:01
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-22 20:04:16
+ */
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int n, k;
+
+bool a[1000010], b[1000010];
+
+int main() {
+    cin >> n >> k;
+    string s;
+    cin >> s;
+    a[k] = true;
+    for (char c : s) {
+        if (c == 'L' || c == '?') {
+            for (int i = 2; i <= n; i++) {
+                if (a[i]) {
+                    b[i - 1] = true;
+                }
+            }
+            if (a[1]) {
+                b[1] = true;
+            }
+        }
+        if (c == 'R' || c == '?') {
+            for (int i = 1; i < n; i++) {
+                if (a[i]) {
+                    b[i + 1] = true;
+                }
+            }
+            if (a[n]) {
+                b[n] = true;
+            }
+        }
+        swap(a, b);
+    }
+    for (int i = 1; i <= n; i++) {
+        putchar(a[i] ? '1' : '0');
+    }
+    return 0;
+}

Codes/MeiTuan-Summer2025-03-03-All1-0分.cpp

@@ -0,0 +1,47 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-22 20:05:24
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-22 20:05:24
+ */
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int n, k;
+
+bool a[1000010], b[1000010];
+
+int main() {
+    cin >> n >> k;
+    string s;
+    cin >> s;
+    // a[k] = true;
+    // for (char c : s) {
+    //     if (c == 'L' || c == '?') {
+    //         for (int i = 2; i <= n; i++) {
+    //             if (a[i]) {
+    //                 b[i - 1] = true;
+    //             }
+    //         }
+    //         if (a[1]) {
+    //             b[1] = true;
+    //         }
+    //     }
+    //     if (c == 'R' || c == '?') {
+    //         for (int i = 1; i < n; i++) {
+    //             if (a[i]) {
+    //                 b[i + 1] = true;
+    //             }
+    //         }
+    //         if (a[n]) {
+    //             b[n] = true;
+    //         }
+    //     }
+    //     swap(a, b);
+    // }
+    for (int i = 1; i <= n; i++) {
+        putchar('1');
+    }
+    return 0;
+}