2021/09

BFS 부분 실수 for(int i=1; i

실수한 부분 1. DP[1], DP[2] 초기화 2. N이 1인 경우에는 DP[2]가 존재하지 않음 (ArrayIndexOutOfBound Exception 방지) 3. 점화식 DP[i] = Math.max( DP[i-2], DP[i-3]+score[i-1]) + score[i]; 이 부분의 DP[i-3]+score[i-1]은 DP[i-1]이 아님.. DP[i-1]이 더 큰 개념 DP[i-1]은 DP[i-2] + score[i-1] 또는 DP[i-3] + score[i-1] 둘 중 하나임.. 개념을 좁혀준거임 'DP[i]로 오기 전에 2칸을 뛰었습니다'라는 조건을 점화식에 담아준 것 이걸 안 담아주고 DP[i-1]을 점화식에 넣어버리면 문제에서 요구하는 조건인 세 칸을 연속해서(한칸씩) 건너갈 수 없습니..

123456789101112131415161718192021222324252627282930313233343536373839import java.io.BufferedReader;import java.io.BufferedWriter;import java.io.IOException;import java.io.InputStreamReader;import java.io.OutputStreamWriter; public class Main { private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); private static BufferedWriter bw = new BufferedWriter(new OutputS..

1234567891011121314151617181920212223242526import java.io.BufferedReader;import java.io.BufferedWriter;import java.io.IOException;import java.io.InputStreamReader;import java.io.OutputStreamWriter; public class Main { private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); private static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); ..

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485import java.util.*; class Solution { class Node{ boolean removed; Node prev; Node next; } Node[] NodeArr = new Node[1000000]; public String solution(int n, int k, String[] cmd) { for(int i=0; i

BFS가 정석인데 완전탐색으로 가라쳐서 했음 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 import java.util.*; class Solution { public int[] solution(String[][] places) { List list = new ArrayList(); Loop1 : for(String[] place : places){ char[][] waitArr = new char[10][10]; for(int i=2; i

12345678910111213141516171819202122232425262728293031323334import java.util.*; class Solution { public int solution(String s) { Map map = new HashMap(); map.put("zero", 0); map.put("one", 1); map.put("two", 2); map.put("three", 3); map.put("four", 4); map.put("five", 5); map.put("six", 6); map.put("seven", 7); map.put("eight", 8); map.put("nine", 9); System.out.println(s); for(Map.Entry entry : ..

for문 깊을 때는 함수로 빼서 처리해야되는데 그냥 귀찮아서 4중 for문씀 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 import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.InputStrea..

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869import java.io.BufferedReader;import java.io.BufferedWriter;import java.io.IOException;import java.io.InputStreamReader;import java.io.OutputStreamWriter;import java.util.Stack; public class Main { private static BufferedReader br = new BufferedReader(new InputStreamRe..

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960import java.io.BufferedReader;import java.io.BufferedWriter;import java.io.IOException;import java.io.InputStreamReader;import java.io.OutputStreamWriter;import java.util.LinkedList; public class Main { private static BufferedReader br = new BufferedReader(new InputStreamReader(System.i..