update: 添加问题“2614.对角线上的质数”的代码和题解(#823)

feat: under merge标签(#821)

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

Author: LetMeFly666

.commitmsg

@@ -1,3 +1 @@
-docs: 柠檬微趣题解 - 小改
-
-word: en words
+feat: under merge标签(#821)

.gitignore

@@ -1,6 +1,8 @@
 del*
 OtherSource
 __pycache__
+# 因为邮件上说不让泄露面试内容，所以自己总结总结看看好了
+字节后端开发-搜索-一面.md
 
 # Prerequisites
 *.d

Codes/2614-prime-in-diagonal.cpp

@@ -0,0 +1,38 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-18 23:40:09
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-18 23:43:36
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+private:
+    bool isPrime(int n) {
+        if (n < 2) {
+            return false;
+        }
+        int k = sqrt(n);
+        for (int i = 2; i <= k; i++) {
+            if (n % i == 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+public:
+    int diagonalPrime(vector<vector<int>>& nums) {
+        int ans = 0;
+        for (int i = 0; i < nums.size(); i++) {
+            if (isPrime(nums[i][i])) {
+                ans = max(ans, nums[i][i]);
+            }
+            if (isPrime(nums[i][nums.size() - i - 1])) {
+                ans = max(ans, nums[i][nums.size() - i - 1]);
+            }
+        }
+        return ans;
+    }
+};

Codes/2614-prime-in-diagonal.go

@@ -0,0 +1,31 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-18 23:55:55
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-18 23:58:46
+ */
+package main
+
+func isPrime2614(n int) (ans bool) {
+    if n < 2 {
+        return
+    }
+    for i := 2; i * i <= n; i++ {
+        if n % i == 0 {
+            return
+        }
+    }
+    return true
+}
+
+func diagonalPrime(nums [][]int) (ans int) {
+    for i := range nums {
+        if isPrime2614(nums[i][i]) {
+            ans = max(ans, nums[i][i])
+        }
+        if isPrime2614(nums[i][len(nums) - i - 1]) {
+            ans = max(ans, nums[i][len(nums) - i - 1])
+        }
+    }
+    return
+}

Codes/2614-prime-in-diagonal.java

@@ -0,0 +1,33 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-18 23:50:23
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-18 23:55:24
+ */
+class Solution {
+    private boolean isPrime(int n) {
+        if (n < 2) {
+            return false;
+        }
+        int k = (int)Math.sqrt(n);
+        for (int i = 2; i <= k; i++) {
+            if (n % i == 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+
+    public int diagonalPrime(int[][] nums) {
+        int ans = 0;
+        for (int i = 0; i < nums.length; i++) {
+            if (isPrime(nums[i][i])) {
+                ans = Math.max(ans, nums[i][i]);
+            }
+            if (isPrime(nums[i][nums.length - i - 1])) {
+                ans = Math.max(ans, nums[i][nums.length - i - 1]);
+            }
+        }
+        return ans;
+    }
+}

Codes/2614-prime-in-diagonal.py

@@ -0,0 +1,26 @@
+'''
+Author: LetMeFly
+Date: 2025-03-18 23:46:52
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-03-18 23:48:14
+'''
+from typing import List
+from math import sqrt
+
+class Solution:
+    def isPrime(self, n: int) -> bool:
+        if n < 2:
+            return False
+        for i in range(2, int(sqrt(n)) + 1):
+            if n % i == 0:
+                return False
+        return True
+    
+    def diagonalPrime(self, nums: List[List[int]]) -> int:
+        ans = 0
+        for i in range(len(nums)):
+            if self.isPrime(nums[i][i]):
+                ans = max(ans, nums[i][i])
+            if self.isPrime(nums[i][len(nums) - i - 1]):
+                ans = max(ans, nums[i][len(nums) - i - 1])
+        return ans

Codes/bytedance-2025summer-HouDuanKaiFa-Sousuo-2Mian-00-初版.cpp

@@ -0,0 +1,102 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-18 21:00:06
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-18 21:05:19
+ */
+#include <iostream>
+using namespace std;
+
+struct Node {
+    int val;
+    Node* next;
+
+    Node(int val, Node* next): val(val), next(next) {};
+};
+
+void debug(Node* head) {
+    head = head->next;
+
+    while (head) {
+        cout << head->val << ',';
+        head = head->next;
+    }
+    puts("");
+}
+
+void debug(Node* from, Node* to) {
+    while (from != to) {
+        cout << from->val << ',';
+        from = from->next;
+    }
+    if (to) {
+        cout << to->val << endl;
+    }
+}
+
+void realRev(Node* last, Node* to) {
+    debug(last, to);
+    // return;
+    int cnt = 0;
+
+
+    Node* p = last->next;
+    // last->next = nullptr;
+    while (p != to) {
+        cnt++;
+        cout << p->val << endl;
+        if (cnt > 15) {
+            break;
+        }
+        Node* next = p->next;
+        p->next = last;
+        last = p;
+        p = next;
+    }
+    to->next = last;
+}
+
+void rev(Node* p, int k) {
+    Node* last = p;
+    int cnt = 0;
+    while (p) {
+        p = p->next;
+        if (p) {
+            cnt++;
+        }
+        if (cnt == k) {
+            // reverse
+            Node* next = p->next;
+            realRev(last, p);
+            last->next = next;
+            last = p;
+            cnt = 0;
+            p = next;
+        }
+    }
+}
+
+
+/*
+3 8
+1 2 3 4 5 6 7 8
+
+*/
+int main() {
+    // char str[3];
+    // std::cin>>str;
+    // std::cout << "hello world" << std::endl;
+    int k, n, t;
+    cin >> k >> n;
+    Node* head = new Node(0, nullptr);
+    Node* p = head;
+    for (int i = 0; i < n; i++) {
+        cin >> t;
+        Node* thisNode = new Node(t, nullptr);
+        p->next = thisNode;
+        p = p->next;
+    }
+    rev(head, k);
+    debug(head);
+    return 0;
+}