Java实现给定一个矩阵从右上方到左下方逐行输出

给定一个矩阵，按照以下图示的样式输出：

                                                             

public class shuchu {
	public static void main(String[] args) {
		int [][] n = {
				{1,2,3,4,5},
				{2,3,4,5,6},
				{3,4,5,6,7},
				{4,5,6,7,8},
				{5,6,7,8,9},
				{6,7,8,9,0},
				{7,8,9,0,1}	
		};
		int row = n.length;
		int col = n[0].length;
		int all = row+col-1;
		int count = 0;
		for(int i = 0;i<all;i++) {
		
			int x = 0;
			if(i>col-1) {
				x = i - col +1;
			}
			for(int j = (i > (col - 1)) ? col-1 : i;  j>=((i>(row-1))? (i-(row-1) ):0) ;j-- ) {
				System.out.print(n[x][j] + "");
				x++;
				count++;
			}
			 System.out.println();
		}
		System.out.println("查找次数"+count+"次");
	}
}

结果：
1
22
333
4444
55555
66666
77777
8888
999
00
1
查找次数35次