코딩/C언어
배열 회전 (90도)
런던전통손만두
2019. 3. 18. 19:04
반응형
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47 |
#include <stdio.h>
void printBoard(int arr[][4], int size);
void turn90(int arr[][4], int arr2[][4], int size);
int main(void)
{
int A[4][4];
int B[4][4];
int i, j;
int n = 1;
for (i = 0; i < 4; i++)
for (j = 0; j < 4; j++)
{
A[i][j] = n;
n++;
}
printBoard(A, 4);
turn90(A, B, 4);
turn90(B, A, 4);
turn90(A, B, 4);
turn90(B, A, 4);
}
void printBoard(int arr[][4], int size)
{
int i, j;
for (i = 0; i < size; i++)
{
for (j = 0; j < 4; j++)
printf("%3d", arr[i][j]);
printf("\n");
}
printf("\n\n");
}
void turn90(int arr[][4], int arr2[][4], int size)
{
int i, j;
for (i = 0; i < 4; i++)
for (j = 0; j < 4; j++)
arr2[i][j] = arr[3 - j][i];
printBoard(arr2, 4);
} |
cs |
결과:
반응형