import java.util.*; class Solution { public String solution(int n, int t, int m, String[] timetable) { String answer = ""; ArrayList list = new ArrayList(); for(int i=0; i= list.get(idx)){ lastTime = list.get(idx); // 마지막으로 탄 사람 갱신 idx++; cnt++; if(idx >= list.size()) break; }else{ break; } } busStartTime += t; } if(cnt < m){ // 마지막 버스에 자리가 있음 answer = time2str(busStartTime-t); }else { // 마지막 버스..

public class Solution { public boolean solution(int[][] key, int[][] lock) { int padSize = lock.length - 1; for (int i = 0; i < 4; i++) { key = rotate(key); int[][] paddedKey = pad(key, padSize); for (int j = 0; j < paddedKey.length - padSize; j++) { for (int k = 0; k < paddedKey.length - padSize; k++) { if (isValid(lock, paddedKey, j, k)) { return true; } } } } return false; } private boolean i..

import java.util.*; class Edge implements Comparable{ int index; int cost; Edge(int index, int cost){ this.index = index; this.cost = cost; } @Override public int compareTo(Edge e){ return this.cost - e.cost; } } class Solution { static final int MAX = 20000001; // 200 * 100000 + 1 static ArrayList graph; public int solution(int n, int s, int a, int b, int[][] fares) { int answer = Integer.MAX_V..

import java.util.*; public class Solution { public int solution(int[][] board) { int[] dy = {-1, 1, 0, 0}, dx = {0, 0, -1, 1}; int N = board.length; int[][][] cost = new int[N][N][4]; for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) Arrays.fill(cost[i][j], Integer.MAX_VALUE); Queue queue = new LinkedList(); queue.add(new int[]{0, 0, 0, 1}); queue.add(new int[]{0, 0, 0, 3}); while (!queue...

import java.util.*; class Solution { // 사람을 인덱스로 매핑 public Map people = new HashMap(); public int[] answer; // 각 인덱스의 최종 결과 public String[] parent;// 인덱스를 추천한 사람을 의미하는 변수 public int[] solution(String[] enroll, String[] referral, String[] seller, int[] amount) { parent = new String[enroll.length]; answer = new int[enroll.length]; for(int i = 0; i < enroll.length; i++) { people.put(enroll[i],i); /..

import java.util.*; class Solution { int[][] result; int idx; public int[][] solution(int[][] nodeinfo) { //노드를 입력받는다. Node[] node = new Node[nodeinfo.length]; for(int i = 0; i < nodeinfo.length; i++) { node[i] = new Node(nodeinfo[i][0], nodeinfo[i][1], i + 1, null, null); } //y값 큰 순서대로, y값 같다면 x값 작은 순서대로 정렬 Arrays.sort(node, new Comparator() { @Override public int compare(Node n1, Node n2) { if..

class Solution { public int solution(int n, int[] money) { int[][] dp = new int[money.length+1][n+1]; int answer = 0; for(int i=1; i

import java.util.*; class Solution { public int solution(int n, int[][] results) { int answer = 0; int[][] graph = new int[n+1][n+1]; for(int i = 0; i < results.length; i++) graph[results[i][0]][results[i][1]] = 1; //이김 for(int i = 0; i