지잉지잉 개발일기 지잉지잉 개발일기

문제 풀이 import java.util.ArrayList; import java.util.List; import java.util.Scanner; class Main { /** * @param args */ public static void main(String[] args) { Scanner scan = new Scanner(System.in); int tokenCount = scan.nextInt(); int goal = scan.nextInt(); List tokenList = new ArrayList(); for (int i = 0; i < tokenCount; i++) { tokenList.add(scan.nextInt()); } int count = 0; for(int i = tokenCou..

문제 풀이 import java.util.ArrayList; import java.util.List; import java.util.Scanner; class Main { /** * @param args */ public static void main(String[] args) { Scanner scan = new Scanner(System.in); int point = scan.nextInt(); int line = scan.nextInt(); int[][] arr = new int[point+1][point+1]; // 그래프 생성 for (int i = 0; i < line; i++) { int a = scan.nextInt(); int b = scan.nextInt(); arr[a][b] = 1;..

문제 풀이 import java.util.LinkedList; import java.util.Queue; import java.util.Scanner; class Main { /** * @param args */ public static void main(String[] args) { Scanner scan = new Scanner(System.in); int point = scan.nextInt(); int line = scan.nextInt(); int start = scan.nextInt(); int[][] arr = new int[point+1][point+1]; // 그래프 생성 for(int i=1;i

1. 문제 2. 풀이 import java.util.*; class Solution { public int solution(int[] people, int limit) { int answer = 0; Arrays.sort(people); List list = new ArrayList(); for (int i = 0; i 1) { if (list.get(0) + list.get(list.size() - 1)

1. 문제 2. 풀이 import java.util.*; class Solution { private final static String LEFT = "("; private final static String RIGHT = ")"; boolean solution(String s) { boolean answer = true; List sList = new ArrayList(); for (int i = 0; i < s.length(); i++) { String g = s.substring(i, i+1); sList.add(g); } int count = 0; int idx = 0; while(idx < sList.size()) { if (sList.get(idx).equals(LEFT)) { idx++; c..

1. 문제 2. 풀이 import java.util.*; class Solution { public int solution(String[][] clothes) { int answer = 1; HashMap map = new HashMap(); for (int i = 0; i < clothes.length; i++) { String item = clothes[i][0]; String category = clothes[i][1]; Integer categoryCount = map.get(category); if (categoryCount == null) categoryCount = 0; categoryCount++; map.put(category, categoryCount); } Iterator keys =..