天天看点

之字形打印矩阵_C++

之字形打印矩阵_C++
#include<iostream>
#define MAXROW 3
#define MAXCOL 4
using namespace std;
//打印之字形矩阵
//压中的点是每条对角线最右上的点(tR,tC)和最左下(dR,dC)的点
//右上点的移动逻辑:每次往左移动,移动不了了往下移动
//左下点的移动逻辑:每次往下移动,移动不了了往右移动
//upToDown:从上往下
void printDiagonal(int m[][MAXCOL],int tR,int tC,int dR, int dC, bool upToDown)
{
	if(upToDown)
	{
		while(tR<=dR)
			cout<<m[tR++][tC--]<<"\t";
	}
	else
	{
		while(dR>=tR)
			cout<<m[dR--][dC++]<<"\t";
	}
}
 
void printSpecialMatrix(int m[][MAXCOL])
{
	cout<<"==============NEW MATRIX=============="<<endl;
	int tR=0,tC=0;
	int dR=0,dC=0;
	int endR = MAXROW-1,endC = MAXCOL-1;
	bool upToDown = false;
	while(tR <= endR)
	{
		printDiagonal(m,tR,tC,dR, dC, upToDown);
		tR = tC == endC ? tR + 1 : tR;
		tC = tC == endC ? tC : tC + 1;
		dC = dR == endR ? dC + 1 : dC;
		dR = dR == endR ? dR : dR + 1;
		
		upToDown = !upToDown;
	}
	cout<<endl;
	
}
 
void printMatrix(int m[][MAXCOL])
{
	cout<<"==============OLD MATRIX=============="<<endl;
	for(int i=0;i<MAXROW;i++)
	{
		for(int j=0;j<MAXCOL;j++)
			cout<<m[i][j]<<"\t";
		cout<<endl;
	}
		
}
 
int main()
{
	int matrix[MAXROW][MAXCOL] = {{1,2,3,4},{5,6,7,8},{9,10,11,12}};
	printMatrix(matrix);
	printSpecialMatrix(matrix);
	return 0;
}
 
           

继续阅读