剑指offer-面试题20.顺时针打印矩阵

题目:输入一个矩阵,按照从外向里以顺时针的顺序依次打印出每一个数字。例如:

输入一个矩阵如下:

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

这道题的类似于:http://www.cnblogs.com/vpoet/p/4660520.html(LeeCode-Spiral Matrix 11)

 

其实主要还是考察我们对二维数组的循环操作:

代码实现如下:

#include <iostream>
using namespace std;

void PrintMatrixClockwisely(int** numbers,int columns,int rows)
{
    cout<<endl<<"The Matrix is: "<<endl;;
    for(int i=0;i<rows;i++)
    {
        for(int j=0;j<columns;j++)
        {
            cout<<numbers[i][j]<<"   ";
        }
        cout<<endl;
    }

    cout<<endl<<"The Output Array of Matrix is: ";


    int count=0;
    int left=0;
    int top=0;
    int bottom=rows-1;
    int right=columns-1;
    while(count<(columns*rows))
    {
        for(i=left;i<=right;i++)
        {
            cout<<numbers[left][i]<<" ";
            count++;
        }
        top++;
        

        for(i=top;i<=bottom;i++)
        {
            cout<<numbers[i][right]<<" ";
            count++;
        }
        right--;

        for(i=right;i>=left;i--)
        {
            cout<<numbers[bottom][i]<<" ";
            count++;
        }
        bottom--;

        for(i=bottom;i>=top;i--)
        {
            cout<<numbers[i][left]<<" ";
            count++;
        }
        left++;

    }
}



void main()
{
    int **nums;
    int cols;
    int rows;
    int i,j;
    cout<<"Please input the rows: ";
    cin>>rows;

    cout<<"Please input the cols: ";
    cin>>cols;

    nums=new int*[rows];
    for(i=0;i<rows;i++)
        nums[i]=new int[cols];


    for(i=0;i<rows;i++)
    {
        cout<<"Please input the "<<i+1<<"th"<<" rows: "<<endl;;
        for(j=0;j<cols;j++)
        {
            int data;
            cin>>data;
            nums[i][j]=data;
        }
    }
    

    PrintMatrixClockwisely(nums,cols,rows);


    for(i=0;i<rows;i++)
        delete[] nums[i];
    delete[] nums;
    return;
}

运行截图: