휴먼교육센터 개발자과정 29일차

package Tr;

public class Day12_01 {

public static void main(String[] args) {
	// 2차원 배열
	int cnt = 1;
	int[][] c = new int[4][8];
	// 선언과 동시에 값 입력
//		int c[][]= {
//				{1,2,3,4,5,6,7,8},
//				{1,2,3,4,5,6,7,8},
//				{1,2,3,4,5,6,7,8},
//				{1,2,3,4,5,6,7,8}
//		};

	for (int i = 0; i < c.length; i++) {
		for (int j = 0; j < 8; j++) {
			c[i][j] = cnt;
			cnt++;
		}
	}
	for (int i = 0; i < 4; i++) {
		for (int j = 0; j < 8; j++) {
			System.out.print(c[i][j] + "\t");
		}
		System.out.println();
	}
	System.out.println("---------------------");
	
	int[][] d = new int[4][5];
	int cnt2 = 1;
	for (int i = 0; i < d.length; i++) {
		for (int j = 4; j >= 0; j--) {
			d[i][j] = cnt2;
			cnt2++;
		}
	}
	for (int i = 0; i < d.length; i++) {
		for (int j = 0; j < 5; j++) {
			System.out.print(d[i][j] + "\t");
		}
		System.out.println();
	}
}

}

실습

package Tr;

public class Day12_02 {

public static void main(String[] args) {
	// TODO Auto-generated method stub
	int[][] a = new int[4][5];
	int cnt = 1;
	for (int i = 0; i < 5; i++) {
		for (int j = 0; j < a.length; j++) {
			a[j][i] = cnt;
			cnt++;
		}
	}
	for (int i = 0; i < a.length; i++) {
		for (int j = 0; j < 5; j++) {
			System.out.print(a[i][j] + "\t");
		}
		System.out.println();
	}

	System.out.println("---------------------------");
	int[][] b = new int[4][5];
	int cnt2 = 1;
	for (int i = 4; i >= 0; i--) {
		for (int j = 0; j < 4; j++) {
			b[j][i] = cnt2;
			cnt2++;
		}
	}
	for (int i = 0; i < b.length; i++) {
		for (int j = 0; j < 5; j++) {
			System.out.print(b[i][j] + "\t");
		}
		System.out.println();
	}

	System.out.println("---------------------------");
	int[][] c = { { 5, 32, 23, 34, 2 }, { 4, 12, 13, 36, 6 }, { 87, 62, 21, 43, 97 }, { 65, 32, 12, 32, 22 } };

	for (int i = 0; i < c.length; i++) {
		int sum = 0;
		for (int j = 0; j < 5; j++) {
			sum += c[i][j];
		}
		System.out.println(i + "행의 합= " + sum);
	}
	System.out.println("---------------------------");
	for (int i = 0; i < 5; i++) {
		int sum = 0;
		for (int j = 0; j < c.length; j++) {
			sum += c[j][i];
		}
		System.out.println(i + "열의 합= " + sum);
	}
}

}

package Test;

import java.util.Scanner;

public class Day12_01 {

public static void main(String[] args) {
	Scanner in = new Scanner(System.in);
	
	// 문제 5
	System.out.println("스네이크 배열 만들기 ");
	System.out.println("행의 갯수 입력: ");
	int f = in.nextInt();
	in.nextLine();
	System.out.println("열의 갯수 입력: ");
	int g = in.nextInt();
	in.nextLine();
	int[][] a = new int[f][g];
	int cnt = 1;
	for (int i = 0; i < a.length; i++) {
		if (i % 2 == 0) {
			for (int j = 0; j < g; j++) {
				a[i][j] = cnt;
				cnt++;
			}
		} else {
			for (int j = g-1; j >= 0; j--) {
				a[i][j] = cnt;
				cnt++;
			}
		}
	}

	for (int i = 0; i < a.length; i++) {
		for (int j = 0; j < g; j++) {
			System.out.print(a[i][j] + "\t");
		}
		System.out.println();
	}
	System.out.println("-------------------------------");

	// 문제 6
	System.out.println("대각선 배열 만들기 ");
	System.out.println("행의 갯수 입력: ");
	int dd = in.nextInt();
	in.nextLine();
	System.out.println("열의 갯수 입력: ");
	int ee = in.nextInt();
	in.nextLine();
	int[][] b = new int[dd][ee];
	int cnt2 = 1;
	for (int i = 0; i <= (dd-1)+(ee-1); i++) {
		for (int j = 0; j < b.length; j++) {
			for (int k = ee-1; k >= 0; k--) {
				if (j + k == i) {
					b[j][k] = cnt2;
					cnt2++;
				}
			}
		}
	}
	
	for (int i = 0; i < b.length; i++) {
		for (int j = 0; j < ee; j++) {
			System.out.print(b[i][j] + "\t");
		}
		System.out.println();
	}
	System.out.println("-------------------------------");

	// 문제 7
	int[][] c = { { 54, 23, 23, 53, 23 }, { 3, 21, 22, 32, 2 }, { 2, 32, 22, 12, 23 }, { 32, 32, 12, 33, 32 } };

	int[][] d = new int[4][5];

	for (int i = 0; i < d.length; i++) {
		for (int j = 0; j < 5; j++) {
			d[i][j] = a[i][j] + c[i][j];
		}
	}
	for (int i = 0; i < d.length; i++) {
		for (int j = 0; j < 5; j++) {
			System.out.print(d[i][j] + "\t");
		}
		System.out.println();
	}
	System.out.println("-------------------------------");

	// 문제 8

	

	System.out.println("달팽이 배열 만들기 ");
	System.out.println("행의 갯수 입력: ");
	int k = in.nextInt();
	in.nextLine();
	System.out.println("열의 갯수 입력: ");
	int z = in.nextInt();
	in.nextLine();
	int[][] e = new int[k][z];
	int x = k;
	int y = z;
	int num = 1;
	int bb = 0;
	int cc = 0;
	in.close();
	for (; cc <= x;) {
		for (int i = bb; i < x; i++) {
			for (int j = cc; j <= y - 1; j++) {
				if (i == bb) {
					e[i][j] = num;
					num++;
				} else if (j == y - 1) {
					e[i][j] = num;
					num++;
				}
			}
		}
		bb++;
		y--;
		x--;
		for (int i = x; i >= bb; i--) {
			for (int j = y - 1; j >= cc; j--) {
				if (i == x) {
					e[i][j] = num;
					num++;
				} else if (j == cc) {
					e[i][j] = num;
					num++;
				}
			}
		}
		cc++;
	}

	for (int i = 0; i < e.length; i++) {
		for (int j = 0; j < z; j++) {
			System.out.print(e[i][j] + "\t");
		}
		System.out.println();
	}
}

}