Algorithm

class Solution { public int solution(int n, int a, int b) { int answer = 0; int divideNum = n / 2; int middleNum = n / 2; while(divideNum > 1) { //한쪽에 몰려 있다면? if(middleNum a && middleNum + 1 > b) { divideNum /= 2; middleNum = middleNum - divideNum; } //한쪽에 몰려 있지 않다면? else ..

//최소한의 종류, 최대한의 개수import java.util.*;class Solution { public int solution(int k, int[] tangerine) { int answer = 0; Map counting = new HashMap(); for(int i : tangerine) { counting.put(i, counting.getOrDefault(i, 0) + 1); } List valueList = new ArrayList(counting.values()); valueList.sort(Collections.reverseOrder()); ..

import java.util.LinkedList;import java.util.Queue;class Solution { public int solution(String[] board) { int[] goal = new int[2]; int[] start = new int[2]; Queue nextNode = new LinkedList(); boolean[][] visited = new boolean[board.length][board[0].length()]; for (int i = 0; i = board.length || newY = board[0].length() || board[newX].charAt(ne..

//dfs으로 하면 시간초과// % 1234567이니까 무조건이다./*1121123111211241111112121211225111111112112112112111221122212611111111112111211121112111211112211211221211122222dp[n] = dp[n-1] + dp[n-2]*/class Solution { public long solution(int n) { long[] dp = new long[2001]; dp[0] = 0; dp[1] = 1; dp[2] = 2; for(int i = 3; i  풀이1. 우선 % 1234567을 한다는건 경우의수가 엄청나다는 것이니 탐색으로..

//동전 종류 N//동전 가치의 합 K//동전의 개수 나와있지 않지만 많음?//내림차순으로 최대한 금액넣기import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int N = in.nextInt(); int K = in.nextInt(); int[] coins = new int [N]; for(int i = 0; i = 0; i--) { result += K / coins[i]; K = K % coins[i]; if ..

#include #include #include #include using namespace std;int main() { int n; cin >> n; vector house(3, 0); for (int i = 0; i > color[0] >> color[1] >> color[2]; result[0] = min(house[1] + color[0], house[2] + color[0]); result[1] = min(house[0] + color[1], house[2] + color[1]); result[2] = min(house[0] + color[2], house[1] + color[2]); house[0] = result[0];..