顺时针打印矩阵

14 篇文章 0 订阅
/**
 * 顺时针打印一个矩阵
 */
public class ClockwiseOutput {
	/**
	 * 适合于所有矩阵
	 * @param num
	 * @param startx
	 * @param endx
	 * @param starty
	 * @param endy
	 */
	public void printMatrix(int[][] num, int startx, int endx, int starty, int endy) {
		if (startx == endx) {
			for (int i = starty; i <= endy; i++)
				System.out.print(num[i][startx] + "  ");
			return;
		}
		if (starty == endy) {
			for (int i = startx; i <= endx; i++)
				System.out.print(num[starty][i] + "  ");
			return;
		}
		if (startx > endx || endx <= 0 || starty > endy || endy <= 0)
			return;
		
		for (int i = startx; i <= endx; i++) {
			System.out.print(num[startx][i] + "  ");
		}
		for (int i = starty + 1; i <= endy; i++) {
			System.out.print(num[i][endx] + "  ");
		}

		for (int i = endx - 1; i >= startx; i--) {
			System.out.print(num[endy][i] + "  ");
		}
		for (int i = endy - 1; i > starty; i--) {
			System.out.print(num[i][startx] + "  ");
		}
		printMatrix(num, startx + 1, endx - 1, starty + 1, endy - 1);
	}

	/**
	 * 适合于行数和列数相等的矩阵
	 * @param num
	 * @param start
	 * @param end
	 */
	public void output(int[][] num, int start, int end) {
		if (start > end || end <= 0)
			return;
		for (int i = start; i <= end; i++) {
			System.out.print(num[start][i] + "  ");
		}
		for (int i = start + 1; i <= end; i++) {
			System.out.print(num[i][end] + "  ");
		}

		for (int i = end - 1; i >= start; i--) {
			System.out.print(num[end][i] + "  ");
		}
		for (int i = end - 1; i > start; i--) {
			System.out.print(num[i][start] + "  ");
		}

		output(num, start + 1, end - 1);
	}
	
	public void print(int[][] num, int width, int height) {
		//剑指offer上面的解法,比较复杂
	}
	
	public static void main(String[] args) {
		ClockwiseOutput clock = new ClockwiseOutput();
		
		int[][] nums = {{1, 2, 3},
						{4, 5, 6}, 
						{7, 8, 9}, 
						{10, 11, 12}, 
						{13, 14, 15} };
//		clock.print(nums, 3, 4);
		clock.printMatrix(nums, 0, 2, 0, 4);
		System.out.println();
		
		int[][] nums2 = { {1,  2,  3,  4,  5},
						  {6,  7,  8,  9,  10}, 
						  {11, 12, 13, 14, 15},
						  {16, 17, 18, 19, 20}};
		clock.print(nums2, 5, 4);
		clock.printMatrix(nums2, 0, 4, 0, 3);
		System.out.println();
		
		int[][] nums3 = { {1, 2, 3, 4},
						  {5, 6, 7, 8}, 
						  {9, 10, 11, 12}};
		clock.print(nums3, 4, 3);
		clock.printMatrix(nums3, 0, 3, 0, 2);
		System.out.println();
		
		int[][] nums4 = { {1, 2, 3, 4},
						{5, 6, 7, 8}, 
						{9, 10, 11, 12},
						{13, 14, 15, 16}};
		clock.print(nums4, 4, 4);
//		clock.output(nums4, 0, 3);
		clock.printMatrix(nums4, 0, 3, 0, 3);
		System.out.println();
		
		int[][] nums5 = { {1, 2, 3, 4},
						  {5, 6, 7, 8}, 
						  {9, 10, 11, 12},
						  {13, 14, 15, 16},
						  {17, 18, 19, 20}};
		clock.print(nums5, 4, 5);
		clock.printMatrix(nums5, 0, 3, 0, 4);
		System.out.println();
	}
}

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值