数组小算法

public static void acc2(int N ) {
		int[][] a = new int[N][N];
		int count = 1;
		for (int n = 0; n < 2 * N - 1; n++) {// 2*N-1
			int i = 0;
			int counts=0;
			if (n < N) {
				i=0;
				counts=n+1;
			}else{
				i = n - N + 1;
				counts= 2 * N - n - 1;
			}
			for (int c1=0; c1 <counts; c1++) { // [5,1,4,16]  [5,2,3,17] [5,3,2,17] [5,4,1,17]  // [6,2,4,22] [6,3,3,21] [6,4,2,20]  2*5-6-1=3
				if (n % 2 == 0) {
					a[n-i][i] = count;
				} else {
					a[i][n-i] = count;
				}
				count++;
				i++;
			}
			
		}
		printArray(a);

	}

	static void printArray(int[][] a) {
		int rows = a.length;
		int cols = a[0].length;
		for (int i = 0; i < rows; i++) {
			for (int j = 0; j < cols; j++) {
				System.out.print(a[i][j] + "\t");
			}
			System.out.println("");
		}
		
		System.out.println("============================");
	}

 

 

1	2	6	7	15	
3	5	8	14	16	
4	9	13	17	22	
10	12	18	21	23	
11	19	20	24	25