class Solution { static int size; static int maxSum; static boolean[] isTore; static boolean[] isNotPossible; static int[] stickers; public int solution(int sticker[]) { int answer = 0; if(sticker.length==1) return sticker[0]; if(sticker.length==2) return Math.max(sticker[0],sticker[1]); int[][] dp=new int[sticker.length+1][2]; dp[0][0]=-99999; dp[0][1]=sticker[0]; dp[1][0]=sticker[0]; dp[1][1]=..
import java.util.Arrays; class Solution { public int solution(int n, int[] stations, int w) { int answer = 0; Arrays.sort(stations); int startPoint=1; int coverage=2*w+1; for (int i=0;i=startPoint){ int blockDis=stations[i]-w-startPoint; answer+=blockDis/coverage+1; if(blockDis%coverage==0) answer--; } startPoint=stations[i]+w+1; if(startPoint>n) break; } if(startPoint
import java.util.Arrays; import java.util.stream.Collectors; class Solution { public int solution(int[] A, int[] B) { int answer = 0; Arrays.sort(A); Arrays.sort(B); int searchIndex=-1; boolean endFlag=false; for (int i : A) { while (true){ searchIndex++; if(searchIndex>=B.length){ endFlag=true; break; } if(B[searchIndex]>i){ //현재 A가 가진 가장 낮은 패에 대해서 가장 낮은패로 승리하기 answer++; break; } } if(endFlag) ..
93.5/100 (10,11번 실패) class Solution { public String solution(String play_time, String adv_time, String[] logs) { //그냥 play == adv면 바로 리턴 if(play_time.equals(adv_time)){ return "00:00:00"; } String answer = ""; String[] playTime = play_time.split(":"); int playHour=Integer.parseInt(playTime[0]); int playMinute=Integer.parseInt(playTime[1]); int playSecond=Integer.parseInt(playTime[2]); String[] a..
짜다가 포기한 코드1(--) import java.util.*; class Solution { static boolean[] visit; static Map nodeMap; public int solution(int[] info, int[][] edges) { int answer = 0; nodeMap=new HashMap(); visit=new boolean[info.length]; for (int i = 0; i < info.length; i++) { Node node=new Node(i,info[i]); nodeMap.put(i,node); } for (int i = 0; i < edges.length; i++) { Node parent = nodeMap.get(edges[i][0]); Node c..
정확성100, 효율성 0 코드 class Solution { public int solution(int[][] board, int[][] skill) { int answer = 0; answer=board.length*board[0].length; for (int[] nowSkill : skill) { int type=nowSkill[0]; int modi; if(type==1) modi=-1; else modi=1; int startX=nowSkill[1]; int startY=nowSkill[2]; int endX=nowSkill[3]; int endY=nowSkill[4]; int degree=nowSkill[5]; for (int i = startX; i 0){ //해당 스킬 시행 후 벽이 존재하..
import java.util.*; class Solution { public int[] solution(String[] enroll, String[] referral, String[] seller, int[] amount) { Map memberMap=new HashMap(); Member commander=new Member("-",new Member()); memberMap.put("-",commander); for (int i = 0; i < enroll.length; i++) { String name=enroll[i]; // if(referral[i]=="-"){ // Member member = new Member(name, null); // memberMap.put(name,member); ..
삽질코드(82/100) import java.util.ArrayList; import java.util.List; class Solution { public boolean solution(int[][] key, int[][] lock) { int n=lock.length; List lockPoints=new ArrayList(); Point initPoint,endPoint; initPoint=new Point(n,n); endPoint=new Point(-1,-1); for (int i = 0; i < lock.length; i++) { for (int j = 0; j < lock[i].length; j++) { if(lock[i][j] == 0){ lockPoints.add(new Point(i,j)..
