π°ππππππππ/πΏππππππππππ
[νλ‘κ·Έλλ¨Έμ€/Java] Level2 λ€μ ν° μ«μ
ν΄λ²λ
2023. 12. 6. 18:41
λ°μν
λ¬Έμ
https://school.programmers.co.kr/learn/courses/30/lessons/12981
νλ‘κ·Έλλ¨Έμ€
μ½λ μ€μ¬μ κ°λ°μ μ±μ©. μ€ν κΈ°λ°μ ν¬μ§μ 맀μΉ. νλ‘κ·Έλλ¨Έμ€μ κ°λ°μ λ§μΆ€ν νλ‘νμ λ±λ‘νκ³ , λμ κΈ°μ κΆν©μ΄ μ λ§λ κΈ°μ λ€μ λ§€μΉ λ°μΌμΈμ.
programmers.co.kr
νμ΄
import java.util.HashSet;
class Solution {
public int[] solution(int n, String[] list) {
int[] answer = new int[2];
HashSet<String> word = new HashSet<>();
int index = 0;
for (int i = 0; i < list.length; i++) {
if (i > 0 && word.contains(list[i])) {
index = i;
System.out.println(list[i]);
break;
} else {
word.add(list[i]);
}
if (i < list.length - 1 && list[i].charAt(list[i].length() - 1) != list[i + 1].charAt(0)) {
index = i + 1;
break;
}
}
if (index > 0) {
index += 1; // 9λ²μ§Έ
answer[0] = index % n;
System.out.println(Math.ceil((double)index/n));
answer[1] = (int) Math.ceil((double)index/n);
if (answer[0] == 0) {
answer[0] = n;
}
}
return answer;
}
}
μ λ΅
λ°μν