feat: 新增旋转图像算法实现，包含两种不同的旋转方法

Author: tkzzzzzz6

leetcode/Study Plan/48. 旋转图像/1.cpp

@@ -6,17 +6,17 @@
  */
 class Solution {
 public:
-  void rotate(vector<vector<int>> &matrix) {
-    int n = matrix.size();
-    // 转置
-    for (int i = 0; i < n; ++i) {
-      for (int j = 0; j < i; ++j) {
-        swap(matrix[i][j], matrix[j][i]);
-      }
-    }
+    void rotate(vector<vector<int>>& matrix) {
+       int n = matrix.size();
+        // 转置
+        for(int i = 0;i<n;++i){
+            for(int j = 0;j<i;++j){
+                swap(matrix[i][j],matrix[j][i]);
+            }
+        }
 
-    // 行翻转
-    for (auto &row : matrix)
-      ranges::reverse(row);
-  }
+        // 行翻转
+        for(auto &row:matrix)
+            ranges::reverse(row);
+    }
 };

leetcode/Study Plan/48. 旋转图像/2.cpp

@@ -0,0 +1,19 @@
+/*
+ * @Author: tkzzzzzz6
+ * @Date: 2026-03-22 18:32:49
+ * @LastEditors: tkzzzzzz6
+ * @LastEditTime: 2026-03-23 14:06:15
+ */
+class Solution {
+public:
+  void rotate(vector<vector<int>> &matrix) {
+    int n = matrix.size(), m = matrix[0].size();
+    for (int i = 0; i < n; ++i) {
+      for (int j = i + 1; j < n; ++j) {
+        swap(matrix[i][j], matrix[j][i]);
+        // swap(matrix[i][j],matrix[i][m - j - 1]);
+      }
+      ranges::reverse(matrix[i]);
+    }
+  }
+};