牛客堂常见面试题精讲（一）3

如何实现“之”字形打印矩阵

算法代码实现：

package com.zhao.niuke;

public class Problem_03_ZigZagPrintMatrix {
	public static void printMatrixZigZag(int[][] matrix) {
		int tR = 0;//左上角起始行标
		int tC = 0;//左上角起始列标
		int dR = 0;//
		int dC = 0;//
		int endR = matrix.length - 1;//终止行标
		int endC = matrix[0].length - 1;//终止列标
		boolean fromUp = false;
		//fromup=false表示是否是从上面打印也就是顺序就是1 2 5 9 6 3 4 7 10 11 8 12 
		while (tR != endR + 1) {//循环条件
			printLevel(matrix, tR, tC, dR, dC, fromUp);
			tR = tC == endC ? tR + 1 : tR;
			tC = tC == endC ? tC : tC + 1;
			dC = dR == endR ? dC + 1 : dC;
			dR = dR == endR ? dR : dR + 1;
			fromUp = !fromUp;
		}
		System.out.println();
	}
	public static void printLevel(int[][] m, int tR, int tC, int dR, int dC,
			boolean f) {
		if (f) {	//分两种方式，一个是从左上角开始打印
			while (tR != dR + 1) {
				System.out.print(m[tR++][tC--] + " ");
			}
		} else {
			while (dR != tR - 1) {	//从右下角开始打印
				System.out.print(m[dR--][dC++] + " ");
			}
		}
	}
	public static void main(String[] args) {
		int[][] matrix = { { 1, 2, 3, 4 }, { 5, 6, 7, 8 }, { 9, 10, 11, 12 } };
		printMatrixZigZag(matrix);//之字形打印矩阵
	}
}
/*
 * 实现"之"字形打印矩阵
 * 1   2  3  4
 * 5   6  7  8
 * 9  10  11 12
 * 
 */