코딩하는 등산가

문제 설명 입력&출력 문제풀이 class Solution { public int solution(int[] money) { int answer = 0; //0부터 시작 맨 마지막 제외 int[] dp0 = new int[money.length-1]; //1부터 시작 맨 마지막 포함 int[] dp1 = new int[money.length]; dp0[0] = money[0]; dp0[1] = money[0]; dp1[0] = 0; dp1[1] = money[1]; for(int i = 2 ; i < money.length-1;i++ ){ dp0[i] = Math.max(dp0[i-2]+money[i],dp0[i-1]); } for(int i = 2; i < money.length;i++){ dp1[i] ..

문제 입력&출력 문제풀이 import java.util.*; class Solution { public int solution(int[][] triangle) { int answer = 0; int [][] dp = new int[triangle.length][triangle.length]; dp[0][0]=triangle[0][0]; for(int i = 0 ; i

문제 설명 입출력 문제풀이 class Solution { public int solution(String s) { int answer = s.length(); for(int k=1 ; k

문제 제한사항 문제풀이 class Solution { static int answer; public void dfs(int[] numbers,int target,int idx,int sum){ if(idx == numbers.length){ if(sum == target) answer++; return; } sum+=numbers[idx]; dfs(numbers,target,idx+1,sum); sum-=numbers[idx]*2; dfs(numbers,target,idx+1,sum); } public int solution(int[] numbers, int target) { answer = 0; dfs(numbers,target,0,0); return answer; } } ※ 내 생각 이 문제는 DFS..

문제 제한사항 입출력 문제풀이 import java.util.*; class Solution { class report{ int money; String ref; public report(int money,String ref){ this.money = money; this.ref = ref; } } public int[] solution(String[] enroll, String[] referral, String[] seller, int[] amount) { int[] answer = new int[enroll.length]; HashMap hm = new HashMap(); for(int i = 0 ; i < enroll.length;i++){ hm.put(enroll[i],new report(0,re..

문제 제한 사항 입출력 문제풀이 import java.util.*; class Solution { public int[] solution(int rows, int columns, int[][] queries) { int[] answer = new int [queries.length]; int[][] arr = new int[rows][columns]; int tmp =1; for(int i = 0 ; i < rows;i++){ for(int j = 0 ; j < columns;j++){ arr[i][j]=tmp; tmp++; } } int x1=0,x2=0,y1=0,y2=0; for(int t = 0 ; t < queries.length;t++){ x1 = queries[t][0]-1; y1 = quer..

문제 제한사항 입출력 문제풀이 import java.util.*; class Solution { public int[] solution(int[] lottos, int[] win_nums) { int[] answer = new int[2]; int[] arr = new int[46]; for(int i: lottos){ arr[i]++; } int ans=0; for(int i: win_nums){ if(arr[i]!=0){ ans++; } } int ans2 = ans + arr[0]; if(ans

문제 입출력 문제풀이 import java.util.*; class Solution { public int[] solution(int brown, int yellow) { int[] answer = new int[2]; // x*2+y*2=brown+4; // (x-2)*(y-2)=yello; // xy-2*x-2*y+4=yello; // xy=yello+brown; int k = yellow + brown; int j = 0; for(int i = 1 ; i

문제 제한 사항 및 입출력 문제풀이 import java.util.*; class Solution { public int[] solution(String[] operations) { int[] answer = new int[2]; PriorityQueue pq1 = new PriorityQueue(); PriorityQueue pq2 = new PriorityQueue(Collections.reverseOrder()); String[] tmp; for(int i = 0 ; i < operations.length;i++){ tmp = operations[i].split(" "); if(pq1.size()==0 && tmp[0].equals("D"))continue; if(tmp[0].equals("I"))..

문제 설명 제한사항 입력&출력 문제풀이 import java.util.*; class Solution { static class job { int request; int time; public job(int request, int time) { this.request = request; this.time = time; } } public int solution(int[][] jobs) { int answer = 0; LinkedList works = new LinkedList(); PriorityQueue pq = new PriorityQueue(new Comparator() { @Override public int compare(job i, job j) { return i.time - j.time; }..