LeetCode: Rotate Image

You are given an n x n 2D matrix representing an image.

Rotate the image by 90 degrees (clockwise).

Follow up:
Could you do this in-place?



class Solution {
public:
    void rotate(vector<vector<int> > &matrix) {
        int start = 0, end = matrix.size()-1;
        while(start < end)
        {
            for(int i = 0; i < end-start; i++)
            {
                int temp = matrix[start+i][end];
                matrix[start+i][end] = matrix[start][start+i];
                matrix[start][start+i] = temp;
                
                temp = matrix[end][end-i];
                matrix[end][end-i] = matrix[start][start+i];
                matrix[start][start+i] = temp;
                
                temp = matrix[end-i][start];
                matrix[end-i][start] = matrix[start][start+i];
                matrix[start][start+i] = temp;
            }
            start++;
            end--;
        }
        
    }
};

Round 2:
class Solution {
public:
    void rotate(vector<vector<int> > &matrix) {
        int n = matrix.size();
        int x = 0;
        while(x < n/2)
        {
            for(int j = x; j < n-1-x; j++)
            {
                int temp = matrix[x][j];
                matrix[x][j] = matrix[n-1-j][x];
                matrix[n-1-j][x] = matrix[n-1-x][n-1-j];
                matrix[n-1-x][n-1-j] = matrix[j][n-x-1];
                matrix[j][n-x-1] = temp;
            }
            x++;
        }
        
    }
};






评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值