-
Notifications
You must be signed in to change notification settings - Fork 0
/
cavity_map.java
52 lines (38 loc) · 1.01 KB
/
cavity_map.java
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
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
//solution to: https://www.hackerrank.com/challenges/cavity-map
public class cavity_map {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
String numStr = "";
BigInteger input;
char array[][] = new char[n][n];
for (int i = 0; i < n; i++) {
input = scan.nextBigInteger();
numStr = input.toString();
for (int j = 0; j < numStr.length(); j++) {
char temp = numStr.charAt(j);
array[i][j] = temp;
}
}
for (int k = 1; k < n - 1; k++)
for (int l = 1; l < n - 1; l++) {
if (array[l][k] > array[l][k + 1]
&& array[l][k] > array[l][k - 1]
&& array[l][k] > array[l + 1][k]
&& array[l][k] > array[l - 1][k]) {
array[l][k] = 'X';
}
}
for (int i = 0; i < array.length; i++) {
for (int j = 0; j < array[i].length; j++) {
System.out.print(array[i][j]);
}
System.out.println();
}
}
}