feat(src): add 59-generateMatrix, 61-rotateRight

Author: kwu130

src/59-generateMatrix.cpp

@@ -0,0 +1,63 @@
+//
+// Created by 1412 on 2025/11/5.
+//
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+class Solution {
+public:
+    vector<vector<int>> generateMatrix(int n) {
+        vector<vector<int>> res(n, vector<int>(n, 0));
+        int k = 1;
+        int i = 0, j = 0;
+        while (k <= n * n) {
+            while (j < n && res[i][j] == 0) {
+                res[i][j] = k++;
+                j++;
+            }
+            j--;
+            i++;
+            while (i < n && res[i][j] == 0) {
+                res[i][j] = k++;
+                i++;
+            }
+            i--;
+            j--;
+            while (j >= 0 && res[i][j] == 0) {
+                res[i][j] = k++;
+                j--;
+            }
+            j++;
+            i--;
+            while (i >= 0 && res[i][j] == 0) {
+                res[i][j] = k++;
+                i--;
+            }
+            i++;
+            j++;
+        }
+        return res;
+    }
+};
+
+void test() {
+    Solution s;
+    vector<vector<int>> expected = {
+        {1, 2, 3},
+        {8, 9, 4},
+        {7, 6, 5}
+    };
+    vector<vector<int>> res = s.generateMatrix(3);
+    assert(res == expected);
+
+    expected = {{1}};
+    res = s.generateMatrix(1);
+    assert(res == expected);
+}
+
+int main() {
+    test();
+    return 0;
+}

src/61-rotateRight.cpp

@@ -0,0 +1,56 @@
+//
+// Created by 1412 on 2025/11/5.
+//
+
+#include <bits/stdc++.h>
+#include "../include/common.h"
+
+using namespace std;
+using listHelper::ListNode;
+
+class Solution {
+public:
+    ListNode* rotateRight(ListNode* head, int k) {
+        if (head == nullptr || head->next == nullptr) return head;
+        int len = 0;
+        ListNode *cur = head, *pre = nullptr, *tail = nullptr;
+        while (cur) {
+            len++;
+            tail = cur;
+            cur = cur->next;
+        }
+        k %= len;
+        if (k == 0) return head;
+        int i = len - k;
+        cur = head;
+        while (i--) {
+            pre = cur;
+            cur = cur->next;
+        }
+        pre->next = nullptr;
+        tail->next = head;
+        return cur;
+    }
+};
+
+void test() {
+    Solution s;
+    ListNode* head = listHelper::build({1, 2, 3, 4, 5});
+    ListNode* expected = listHelper::build({4, 5, 1, 2, 3});
+    ListNode* res = s.rotateRight(head, 2);
+    assert(listHelper::equal(res, expected));
+    listHelper::free(head);
+    listHelper::free(expected);
+
+    head = listHelper::build({0, 1, 2});
+    expected = listHelper::build({2, 0, 1});
+    res = s.rotateRight(head, 4);
+    assert(listHelper::equal(res, expected));
+    listHelper::free(head);
+    listHelper::free(expected);
+}
+
+int main() {
+    test();
+    return 0;
+}