메델_project

import java.util.*; public class Solution { public int solution(int n) { int ans = 0; while(n>0){ if(n%2 == 0){ n = n/2; }else{ n = n-1; ans++; } } return ans; } }

import java.util.*; class Solution { static int[] dx = {-1, 1, 0 , 0}; static int[] dy = {0, 0, -1, 1}; public int solution(int[][] maps) { int answer = 0; int[][] ch = new int[maps.length][maps[0].length]; bfs(maps, ch); answer = ch[maps.length-1][maps[0].length-1]; if(answer == 0){ answer = -1; }else{ return answer; } return answer; } public static void bfs(int[][] maps, int[][] ch){ Queue que..

class Solution { public int solution(int n) { int answer = 0; for(int i=1; i

import java.util.*; class Solution { public int solution(int []A, int []B) { int answer = 0; Arrays.sort(A); Arrays.sort(B); for(int i=0; i

class Solution { public int solution(int[][] sizes) { int answer = 0; for(int i=0; isizes[i][1]){ int temp = sizes[i][0]; sizes[i][0] = sizes[i][1]; sizes[i][1] = temp; } } int max = 0; int max2 = 0; for(int i=0; i

class Solution { int answer = 0; public int solution(int[] numbers, int target) { DFS(numbers, 0, target, 0); return answer; } public void DFS(int[] numbers, int depth, int target, int result){ if(numbers.length == depth){ if(target == result) answer++; } else{ DFS(numbers, depth+1, target, result + numbers[depth]); DFS(numbers, depth+1, target, result - numbers[depth]); } } }

import java.util.*; class Solution { public int[] solution(int[] array, int[][] commands) { int[] answer = new int[commands.length]; for(int i=0; i

import java.util.*; class Solution { public String solution(String[] cards1, String[] cards2, String[] goal) { Queue queue1 = new LinkedList(); Queue queue2 = new LinkedList(); for(String x: cards1){ queue1.add(x); } for(String x: cards2){ queue2.add(x); } for(int i=0; i

1. 역순 정렬하기 SELECT name, datetime from animal_ins order by animal_id desc; 2. 여러 기준으로 정렬하기 SELECT ANIMAL_ID, NAME, DATETIME FROM ANIMAL_INS ORDER BY NAME ASC, DATETIME DESC; 3. 모든 레코드 조회하기 SELECT * FROM ANIMAL_INS; 4. 동물의 아이디와 이름 SELECT ANIMAL_ID, NAME FROM ANIMAL_INS ORDER BY ANIMAL_ID; 5. 강원도에 위치한 생산공장 목록 출력하기 SELECT FACTORY_ID, FACTORY_NAME, ADDRESS FROM FOOD_FACTORY WHERE ADDRESS LIKE '강원도%' ..

class Solution { static boolean[] visit; static int num; static int[][] comInfo; public int solution(int n, int[][] computers) { int answer = 0; visit = new boolean[n]; num = n; comInfo = computers; for(int i=0; i< num; i++){ if(!visit[i]){ dfs(i); answer++; } } return answer; } static void dfs(int x){ visit[x] = true; for(int i=0; i