Skip to content

[연로그] 8주차 과제 제출 #245

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
68 changes: 68 additions & 0 deletions 8주차/14906/14906_java_연로그.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,68 @@
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

private static final StringBuilder sb = new StringBuilder();

public static void main(String[] args) throws IOException {
// input
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());

sb.append("SLURPYS OUTPUT\n");
for (int i = 0; i < n; i++) {
String string = br.readLine();
if (isSlurpy(string)) {
sb.append("YES\n");
} else {
sb.append("NO\n");
}
}
sb.append("END OF OUTPUT\n");
System.out.println(sb);
br.close();
}

private static boolean isSlurpy(String string) {
int index = string.lastIndexOf('C');
if (index == -1) {
if (string.startsWith("AH")) {
return isSlump(string.substring(2));
}
return false;
Comment on lines +31 to +34
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
if (string.startsWith("AH")) {
return isSlump(string.substring(2));
}
return false;
return string(startsWith("AH") && isSlump(string.substring(2));

java에서 lastIndexOf, startsWith 문법 새롭게 알고 갑니다 👍

}

String checkSlimp = string.substring(0, index + 1);
String checkSlump = string.substring(index + 1);

return isSlimp(checkSlimp) && isSlump(checkSlump);
}

private static boolean isSlimp(String string) {
int length = string.length();

if (length < 2) {
return false;
}

if (length == 2) {
return "AH".equals(string);
}

if (string.charAt(0) != 'A' || string.charAt(length - 1) != 'C') {
return false;
}

if (string.charAt(1) == 'B') {
return isSlimp(string.substring(2, length - 1));
}

return isSlump(string.substring(1, length - 1));
}

private static boolean isSlump(String string) {
return string.matches("^[DE]F+[DEFG]*G$");
}
}
46 changes: 46 additions & 0 deletions 8주차/16498/16498_java_연로그.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,46 @@
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {

// 3중 for문으로 풀었는데 돌아가는게 맞는걸까요? ........
// 다른 풀이 방법은 생각 안나서 일단 제출합니다 좋은 풀이 방법에 대한 힌트 제안 부탁드려요

public static void main(String[] args) throws IOException {
// input
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
br.readLine();
int[] as = convert(br.readLine());
int[] bs = convert(br.readLine());
int[] cs = convert(br.readLine());
br.close();

// sort
Arrays.sort(as);
Arrays.sort(bs);
Arrays.sort(cs);

// calculate
int min = Integer.MAX_VALUE;
for (int a : as) {
for (int b : bs) {
for (int c : cs) {
min = Math.min(calculate(a, b, c), min);
}
}
}
Comment on lines +26 to +33
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

원래대로라면 이 풀이는 시간초과가 나야 하는 게 맞습니다!
사진에서 볼 수 있듯이 정해는 JAVA에서 100~300ms 정도가 돼야 해요.
image

반드시 세 사람의 점수를 모두 살펴봐야 할까요? 점수의 최댓값과 최솟값이 각각 특정 사람에게 나타날 것이라 고정해놓고 풀면 O(N^2logN)에 풀 수 있을 것 같아요~

System.out.println(min);
}

private static int[] convert(String string) {
return Arrays.stream(string.split(" "))
.mapToInt(Integer::parseInt)
.toArray();
}

private static int calculate(int a, int b, int c) {
return Math.abs(Math.max(a, Math.max(b, c)) - Math.min(a, Math.min(b, c)));
}
}