package org.kyhslam; import java.util.Arrays; public class stack03 { public static int[] solution(int[] prices) { int[] answer = new int[prices.length]; for(int i=0; i prices[j]){ break; } } } System.out.println(Arrays.toString(answer)); return answer; } public static void main(String[] args) { int[] p =..
https://programmers.co.kr/learn/courses/30/lessons/42748 코딩테스트 연습 - K번째수 [1, 5, 2, 6, 3, 7, 4] [[2, 5, 3], [4, 4, 1], [1, 7, 3]] [5, 6, 3] programmers.co.kr package com.hyosung.algo; import java.util.Scanner; public class pro_sort02 { static int[] buff; static void swap(int[]a, int x, int y) { int temp = a[x]; a[x] = a[y]; a[y] = temp; } static void quickSort(int[] a, int left, int right) { int ..
네트워크 https://programmers.co.kr/learn/courses/30/lessons/43162 풀이 class Solution { public int solution(int n, int[][] computers) { int answer = 0; boolean visited[] = new boolean[n+1]; for(int i=0; i < n; i++){ if( visited[i] == false){ answer += dfs(i, computers, visited); } } return answer; } public static int dfs(int x, int[][] computers, boolean[] visited){ if(visited[x]){ return 0; } visited..