건물짓기 | 2차원 배열
Algorithm 2019. 8. 28. 10:04반응형
45분 ~ 50분
|
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
|
using System;
namespace Application
{
class MainClass
{
public static void Main(string[] args)
{
//int[] buildingSize = { 1, 2 };
//int[,] land = { { 0, 0 },
//{ 0, 1 },
//};
int[] buildingSize = { 3, 3 };
int[,] land = { { 1, 0, 0, 0 },
{ 0, 0, 0, 0 },
{ 0, 0, 0, 0 },
{ 0, 0, 0, 0 }
};
var sol = new Solution();
sol.solution(buildingSize, land);
}
}
public class Solution {
int MAX_ROW = 100;
int MAX_COL = 100;
int[,] maps;
int w;
int h;
public int solution(int[] buildingSize, int[,] land) {
int answer = 0;
this.w = buildingSize[0];
this.h = buildingSize[1];
this.CreateMap(land);
this.PrintMap();
//var check1 = this.CheckAvailableBuild(0, 0);
//Console.WriteLine(check1);
//var check2 = this.CheckAvailableBuild(1, 0);
//Console.WriteLine(check2);
//var check3 = this.CheckAvailableBuild(0, 1);
//Console.WriteLine(check3);
//var check4 = this.CheckAvailableBuild(1, 1);
//Console.WriteLine(check4);
//var check2 = this.CheckAvailableBuildRotate(1, 0);
//Console.WriteLine(check2);
for(int row = 0; row<MAX_ROW; row++) {
for(int col = 0; col<MAX_COL; col++) {
var check1 = this.CheckAvailableBuild(col, row);
if (check1) answer += 1;
//크기가 같지 않을경우만
if(w != h) {
var check2 = this.CheckAvailableBuildRotate(col, row);
if (check2) answer += 1;
}
}
}
Console.WriteLine("answer: {0}", answer);
return answer;
}
public bool CheckAvailableBuild(int x, int y) {
//Console.Write("({0},{1}) ~ ({2}~{3})", x, y, x + w, y + h);
for(int i = y; i<y+h; i++) {
for (int j = x; j < x + w; j++)
{
try {
//Console.WriteLine("{0},{1} {2} ", j, i, this.maps[j, i]);
if (this.maps[j, i] == 1 || this.maps[j, i] == -1)
{
return false;
}
}
catch(IndexOutOfRangeException e) {
//TODO: 인덱스 범위를 벗어남
return false;
}
}
}
Console.WriteLine("CheckAvailableBuild: {0},{1}", x, y);
return true;
}
public bool CheckAvailableBuildRotate(int x, int y)
{
//Console.Write("({0},{1}) ~ ({2}~{3})", x, y, x + h, y);
for (int i = y; i < y + w; i++)
{
for (int j = x; j < x + h; j++)
{
try {
//Console.WriteLine("{0},{1} {2} ", j, i, this.maps[j, i]);
if (this.maps[j, i] == 1 || this.maps[j, i] == -1)
{
return false;
}
}catch(IndexOutOfRangeException e) {
//TODO: 인덱스 범위를 벗어남
return false;
}
}
}
Console.WriteLine("CheckAvailableBuildRotate: {0},{1}", x, y);
return true;
}
public void CreateMap(int[,] land = null) {
this.maps = new int[MAX_COL, MAX_ROW];
//Console.WriteLine("{0} {1}", land[0, 0], land[1, 0]);
//Console.WriteLine("{0} {1}", land[0, 1], land[1, 1]);
for (int row = 0; row < MAX_ROW; row++)
{
for (int col = 0; col < MAX_COL; col++)
{
maps[col, row] = -1;
}
}
for (int row = 0; row < MAX_ROW; row++)
{
for (int col = 0; col < MAX_COL; col++)
{
try
{
if(land == null) {
maps[col, row] = 0;
}
else {
maps[col, row] = land[col, row];
}
}
catch (IndexOutOfRangeException e)
{
//TODO: 범위를 벗어남
}
}
}
}
public void PrintMap() {
for (int row = 0; row < MAX_ROW; row++)
{
for (int col = 0; col < MAX_COL; col++)
{
Console.Write("{0, 2} ", maps[col, row]);
}
Console.WriteLine();
}
}
}
}
|
반응형
'Algorithm' 카테고리의 다른 글
| 프로그래머스 | 기능개발 | 큐 (Queue) (0) | 2019.08.28 |
|---|---|
| TODO | 프로그래머스 | 탑 (0) | 2019.08.28 |
| TODO | 백준 | 팰린드롬 (0) | 2019.08.27 |
| TODO | 카카오 | N진수 게임 | 진수 변환 (0) | 2019.08.27 |
| 프로그래머스 | K번째수 | 정렬 (0) | 2019.08.27 |