문과지만 괜찮아

문제 유형: Graph - Floyd Warshall작성 코드첫 번째 시도package KakaoCodingStudy.kakaoNov3;import java.util.*;// First Try BFSpublic class Main3 { static int N; static Map> nodeMap; static int[][] board; static int[][] answer; public static void input(){ Scanner sc = new Scanner(System.in); N = sc.nextInt(); board = new int[N][N]; answer = new int[N][N]; nodeMa..

문제 유형Grpah - BFS작성 코드import java.util.*;public class Main { static int N, M; static Map> nodeMap; static int[] visited; public static void input() { Scanner sc = new Scanner(System.in); // # of nodes N = sc.nextInt(); // # of relationship M = sc.nextInt(); nodeMap = new HashMap(); for (int i = 1; i ()); } for (int i = 0; ..

문제 유형Binary Search작성 코드첫번째 시도package KakaoCodingStudy.kakaoNov1;import java.util.ArrayList;import java.util.List;import java.util.Scanner;// 2473 세용액 1트public class Main { static int N; static long[] given; static long minCombination; static List threeLiquids; public static int getIndex(long num) { int right = threeLiquids.size() - 1; int left = 0; int center;..

문제 유형Binary Search작성 코드import java.util.ArrayList;import java.util.List;import java.util.Scanner;public class Main { public static int N; public static long[] given; public static List dynamic; public static int getIndex(long num) { int right = dynamic.size() - 1; int left = 0; int center; while (left = num) { right = center - 1; ..

문제 유형캐시 정말 캐시작성 코드import java.util.*;class Solution { public int solution(int cacheSize, String[] cities) { int answer = 0; // Cache Algorithm -> LRU Deque cacheLRU = new LinkedList(); for (int i = 0; i cacheSize) { cacheLRU.pollFirst(); } } if (cacheSize == 0) answer = cities.length*5; return answer; }}접근 방식1. 기본적..

문제 유형Recursion작성 코드import java.util.Scanner;public class Main { static StringBuilder answer; static int N; static int M; static String[] givenNums; static String[] row; static boolean[] checks; public static void recursive(int depth, int index) { if (depth == M) { for (String element : row) { answer.append(element).append(" "); } ..

문제 유형Recursion작성 코드import java.util.Arrays;import java.util.Scanner;public class Main { public static StringBuilder answer; public static int[] givenNums; public static int[] row; public static boolean[] checks; public static int N; public static int M; public static void recursive(int depth){ if (depth == M) { for (int element : row) { answ..

문제 유형Recursion작성 코드import java.util.Arrays;import java.util.Scanner;// 백준 N과 M(8)-15657public class Main { public static StringBuilder answer; public static int[] givenNums; public static int[] row; public static boolean[] checks; public static int N; public static int M; public static void recursive(int depth, int index){ if (depth == M) { for (int element..

문제 유형Recursion작성 코드import java.util.Arrays;import java.util.Scanner;public class Main { public static int N; public static int M; public static int[] givenNums; public static int[] row; public static boolean[] checks; public static StringBuilder answer; public static void recursive(int depth, int index) { if (depth == M) { for (int i = 0; i 접근 방식이전의 수열 문제와 ..

문제 유형Recursion작성 코드import java.util.Arrays;import java.util.Scanner;public class Main { public static StringBuilder answer; public static int[] givenNums; public static int[] row; public static boolean[] checks; public static int N; public static int M; public static void recursive(int depth){ if (depth == M) { for (int element : row) { answ..