LeetCode //C - 48. Rotate Image

48. Rotate Image

You are given an n x n 2D matri x representing an image, rotate the image by 90 degrees (clockwise).

You have to rotate the image in-place , which means you have to modify the input 2D matrix directly. DO NOT allocate another 2D matrix and do the rotation.

Example 1:

Input: matrix = \[1,2,3,4,5,6,7,8,9]
Output: \[7,4,1,8,5,2,9,6,3]

Example 2:

Input: matrix = \[5,1,9,11,2,4,8,10,13,3,6,7,15,14,12,16]
Output: \[15,13,2,5,14,3,4,1,12,6,8,9,16,7,10,11]

Constraints:

  • n == matrix.length == matrixi.length
  • 1 <= n <= 20
  • -1000 <= matrixij <= 1000

From: LeetCode

Link: 48. Rotate Image


Solution:

Ideas:

To rotate a matrix by 90 degrees clockwise in place, we can follow a two-step process:

  1. Transpose the Matrix: The transpose of a matrix is obtained by swapping rows and columns. This means

    matrixij will become matrixji.

  2. Reverse the Rows: Reverse each row of the transposed matrix.

Following these steps will give us the rotated matrix.

Code:
c 复制代码
void rotate(int** matrix, int matrixSize, int* matrixColSize) {
    // Transpose the matrix
    for (int i = 0; i < matrixSize; i++) {
        for (int j = i; j < matrixSize; j++) {
            int temp = matrix[i][j];
            matrix[i][j] = matrix[j][i];
            matrix[j][i] = temp;
        }
    }

    // Reverse each row
    for (int i = 0; i < matrixSize; i++) {
        for (int j = 0, k = matrixSize - 1; j < k; j++, k--) {
            int temp = matrix[i][j];
            matrix[i][j] = matrix[i][k];
            matrix[i][k] = temp;
        }
    }
}
相关推荐
Nil20836 分钟前
leetcode 198打家劫舍
算法·leetcode·职场和发展
Shaoshing1 小时前
前缀和与差分
java·数据结构·算法·前缀和·差分
mmmmath_31 小时前
LeetCode.429.N叉树的层序遍历
数据结构·leetcode
wuyk5551 小时前
嵌入式驱动开发:量产级工程化实战(第9篇)——低功耗下的通信可靠性
c语言·驱动开发·stm32·单片机·嵌入式硬件
loulanyue_2 小时前
构建房产认知决策智能:Harness底座与AI自进化的技术实践——读贝壳首席算法科学家尹俊希2026云栖专场演讲
人工智能·算法
学逆向的2 小时前
C 突破编译器限制
c语言·开发语言·网络安全
碧海银沙音频科技研究院2 小时前
基于炬芯ATS录音卡BLE控制协议
人工智能·嵌入式硬件·算法·语音识别
suhan2 小时前
【数据结构】三、栈和队列:6.链队列、双端队列、队列的应用(树的层次遍历、广度优先BFS、先来先服务FCFS)
数据结构·后端·算法
姜鱼问生2 小时前
Docker Volume 备份与恢复实战:不停机迁移数据
后端·算法·架构
suhan2 小时前
【数据结构】三、栈和队列:5.顺序队列(循环队列)(初始化,判空判满,入队,出队,实例)
数据结构·后端·算法