์ผ | ์ | ํ | ์ | ๋ชฉ | ๊ธ | ํ |
---|---|---|---|---|---|---|
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 |
- ์ฐ์ฐ์
- ๋ฐ์ดํฐํ์
- ๋ฐฑ์ค9093
- ๋ฐฑ์ค9012
- ์คํธ๋ฆผ
- ์คํ์์ด
- StringBuffer
- ์ฟ ํกERD
- ๋ฐฐ์ด
- ์ฐ
- ๋ฐฑ์ค1874
- java
- ์ฟ ํกDB
- ๋ฐฑ์ค11053 #ํ์ด์ฌ #python
- stream
- ๋
- ์คํ
- ํ๋ฐฉ์ฟผ๋ฆฌ
- StringBuilder
- ์
- ๋ฌธ์์ด
- ์๋ฐ
- Today
- Total
Tech Log ๐ ๏ธ
๋ฐฑ์ค 3085๋ฒ) ์ฌํ ๊ฒ์ java ๋ณธ๋ฌธ
๋ถ์
์์ ํ์ ๋ฌธ์ ์ด๋ค.
์ฒ์๋ถํฐ ๋๊น์ง ๋น๊ตํด๊ฐ๋ฉด์ ๋ฌด์ํ๊ฒ ๋ต์ ์ฐพ๋ ์ ๋ฐ์๋ ์๋ค..
์ธ์ ํ ์ฌํ์ ์์ด ๋ค๋ฅผ ๊ฒฝ์ฐ ์์น๋ฅผ ๋ณ๊ฒฝํ๋ค๊ณ ํ์์ง๋ง ๊ทธ ์ฝ๋๋ฅผ ์ง๋ ๊ฑฐ ์์ฒด๊ฐ ๋ ๋นํจ์จ์ ์ด๊ธฐ ๋๋ฌธ์
๋ชจ๋ ์ฌํ์ ์์น๋ฅผ ๋ฐ๊พธ๋ฉด์ ๋น๊ตํด๊ฐ๋ ๋ฐฉ์์ผ๋ก ํด๊ฒฐํ์๋ค.
๊ทธ๋ฆฌ๊ณ ์ฌํ์ ๋ฐ๊พธ๋ ๊ฒฝ์ฐ์ ์๋
1. ์์๋ฆฌ๋ผ๋ฆฌ ๋ฐ๊พธ๊ธฐ
2. ์์๋๋ก ๋ฐ๊พธ๊ธฐ
์ด๋ ๊ฒ ๋๊ฐ์ง ๊ฒฝ์ฐ๊ฐ ์์ด์ ๋ ๊ฒฝ์ฐ ๋ชจ๋ ๋น๊ต๋ฅผ ํด์ฃผ์๋ค.
์ฌํ์ ๊ธธ์ด๋ฅผ ๊ตฌํ๋ ๊ฒฝ์ฐ ๋ํ ๋๊ฐ์ง๊ฐ ์๋๋ฐ
1. ๊ฐ๋ก์ค๋ก ์ฌํ์ผ๋ก ๋จน๋ ๊ฒฝ์ฐ
2. ์ธ๋ก ์ค๋ก ์ฌํ์ ๋จน๋ ๊ฒฝ์ฐ
์ด ๋ ๊ฐ์ง ๊ฒฝ์ฐ๋ฅผ ์ฌํ์ ์๋ฆฌ๋ฅผ ๋ฐ๊ฟ ๋๋ง๋ค ๊ฐ๊ฐ ๋น๊ตํด์ฃผ๋ฉด ๋๋ค !
์ฝ๋
import java.util.Arrays;
import java.util.Scanner;
public class Main {
static int num;
static char[][] board;
static int max = 0;
public static void find_row() {
int cnt = 1;
for (int i = 0; i < num; i++) {
cnt = 1;
for (int j = 0; j < num-1; j++) {
if (board[i][j] == board[i][j + 1]) {
cnt++;
} else {
cnt = 1;
}
if (max < cnt) max = cnt;
}
}
}
public static void find_column() {
int cnt = 1;
for (int i = 0; i < num; i++) {
cnt = 1;
for (int j = 0; j < num-1; j++) {
if (board[j][i] == board[j+1][i]) {
cnt++;
} else {
cnt = 1;
}
if (max < cnt) max = cnt;
}
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
num = sc.nextInt();
board = new char[num][num];
for (int i = 0; i < num; i++) {
String str = sc.next();
for (int j = 0; j < num; j++) {
board[i][j] = str.charAt(j);
}
}
char value;
for (int i = 0; i < num; i++) {
for (int j = 0; j < num-1; j++) {
value = board[i][j];
board[i][j] = board[i][j + 1];
board[i][j + 1] = value;
find_row();
find_column();
value = board[i][j];
board[i][j] = board[i][j + 1];
board[i][j + 1] = value;
}
}
for (int i = 0; i < num-1; i++) {
for (int j = 0; j < num; j++) {
value = board[i][j];
board[i][j] = board[i+1][j];
board[i+1][j] = value;
find_row();
find_column();
value = board[i][j];
board[i][j] = board[i+1][j];
board[i+1][j] = value;
}
}
System.out.println(max);
}
}
'์๊ณ ๋ฆฌ์ฆ' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
[๋ฐฑ์ค] ๋ฐฑ์ค ๊ณจ๋ ๋ฌ์ฑ ! (0) | 2023.03.22 |
---|---|
๋ฐฑ์ค 1260๋ฒ) DFS์ BFS java (0) | 2023.03.13 |
๋ฐฑ์ค 2156๋ฒ) ํฌ๋์ฃผ ์์ java (0) | 2023.03.01 |
๋ฐฑ์ค 9465) ์คํฐ์ปค java (0) | 2023.02.27 |
๋ฐฑ์ค 1309) ๋๋ฌผ์ java (0) | 2023.02.25 |