silvergoni.builder()

https://programmers.co.kr/learn/courses/30/lessons/42842 1. 2022.04.09 시도 소요시간: 6분 class Solution { public int[] solution(int brown, int yellow) { int g = 0; int s = 0; for (int i=3; i

https://programmers.co.kr/learn/courses/30/lessons/42627 1. 2022.04.08 시도 소요시간: 74분 //9:31 ~ import java.util.*; class Job { public int start; public int duration; public int diff=0; Job(int start, int duration) { this.start = start; this.duration = duration; } public String toString() { return start + ":" + duration + "("+diff+")"; } } class Solution { public int solution(int[][] jobs) { Priori..

https://leetcode.com/problems/binary-tree-right-side-view/ 1. 2022.03.29 시도 소요시간: 6분(구상 1분, 코딩 5분, recursion ), 4분(iteration) // recursion class Solution { private List result; public List rightSideView(TreeNode root) { result = new ArrayList(); recursion(root, 0); return result; } public void recursion(TreeNode root, int depth) { if (root == null) { return; } if (result.size() == depth) { resul..

https://leetcode.com/problems/n-ary-tree-preorder-traversal/ 1. 2022.01.09 시도 소요시간: 5분(1분 구상, 4분 코딩,recursive), 9분(iterative) // recursive class Solution { public List preorder(Node root) { List output = new ArrayList(); recursive(root, output); return output; } private void recursive(Node root, List output) { if (root == null) { return; } output.add(root.val); for (Node child: root.children) { ..