import java.util.*; class Solution { public int solution(int n) { int answer = 0; List fib = new ArrayList(); fib.add(0); fib.add(1); for(int i=2; i n번째 피보나치 수를 구하기 위한 그 밑의 과정들도 1234567로 나누며 더해준다.

class Solution { public String solution(String number, int k) { String answer = ""; int deleteCount =0; StringBuilder sb = new StringBuilder(number); for(int i=0; i

import java.util.*; class Solution { public int[] solution(int[] progresses, int[] speeds) { int[] answer = {}; int sol = 0; int flag; int[] complete = new int[progresses.length]; ArrayList temp = new ArrayList(); for(int i=0; i

import java.util.*; class Solution { int answer = 0; public int solution(int[] numbers, int target) { ArrayList temp = new ArrayList(); for(int i=0; i=v.size()){ if(sum == dest){ answer++; } return; } dfs(v,dest,sum+v.get(idx),idx+1); dfs(v,dest,sum-v.get(idx),idx+1); } }

class Solution { public int[] solution(int[] prices) { int[] answer = new int[prices.length]; for(int i=0; i

class Solution { public int[] solution(int[] heights) { int[] answer = new int[heights.length]; for(int i= heights.length-1; i>0; i--){ for(int j=i-1; j>=0; j--){ if(heights[i]