顺时针打印矩阵

题目：顺时针打印矩阵

题目描述

输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字，例如，如果输入如下4 X 4矩阵： 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 则依次打印出数字1,2,3,4,8,12,16,15,14,13,9,5,6,7,11,10.

思路

用左上和右下的坐标定位出一次要旋转打印的数据，一次旋转打印结束后，往对角分别前进和后退一个单位。

class Solution {
public:
    vector<int> printMatrix(vector<vector<int> > matrix) {
        int row = matrix.size();
        int col = matrix[0].size();
        vector<int> res;
         
        // 输入的二维数组非法，返回空的数组
        if (row == 0 || col == 0)  return res;
         
        // 定义四个关键变量，表示左上和右下的打印范围
        int left = 0, top = 0, right = col - 1, bottom = row - 1;
        while (left <= right && top <= bottom)
        {
            // left to right
            for (int i = left; i <= right; ++i)  res.push_back(matrix[top][i]);
            // top to bottom
            for (int i = top + 1; i <= bottom; ++i)  res.push_back(matrix[i][right]);
            // right to left
            if (top != bottom)
            for (int i = right - 1; i >= left; --i)  res.push_back(matrix[bottom][i]);
            // bottom to top
            if (left != right)
            for (int i = bottom - 1; i > top; --i)  res.push_back(matrix[i][left]);
            left++,top++,right--,bottom--;
        }
        return res;
    }
};

 

 

 

 

②顺时针，压入vector后，值变0，然后不断的重复4个步骤

class Solution {
public:
    vector<int> printMatrix(vector<vector<int> > matrix) {
        vector<int> res;
        int row=matrix.size(), col=matrix[0].size(),i=0,j=-1;
		while(res.size()<row*col){
            //右 
            while(j+1<col && matrix[i][j+1]!=0){
            	res.push_back(matrix[i][j+1]);
            	matrix[i][j+1]=0;
            	j++;
			}
			
             //下 
            while(i+1<row && matrix[i+1][j]!=0){
            	res.push_back(matrix[i+1][j]);
            	matrix[i+1][j]=0;
            	i++;
			}
			
			//左
			while(j-1>=0 && matrix[i][j-1]!=0){
				res.push_back(matrix[i][j-1]);
				matrix[i][j-1]=0;
				j--;
			} 

			//上
			while(i-1>=0 && matrix[i-1][j]!=0){
				res.push_back(matrix[i-1][j]);
				matrix[i-1][j]=0;
				i--;
			} 
        }
        return res;
    }
};