silvergoni.builder()

https://leetcode.com/problems/container-with-most-water/ 2. 2022.01.30 시도 소요시간: 4분 class Solution { public int maxArea(int[] height) { int left = 0; int right = height.length -1; int ret = 0; while (left < right) { int w = right - left; int h = Math.min(height[left], height[right]); ret = Math.max(ret, w * h); if (height[left] = e) { break; } area = Math.max(area, Math.min(height[s], height[e])*..

https://leetcode.com/problems/keys-and-rooms/ 1. 2022.01.30 시도 소요시간: 11분(3분 구상, 8분 코딩, recursive), 4분(앞서 구상, 4분 코딩, iterative) // recursive class Solution { public boolean canVisitAllRooms(List rooms) { if (rooms == null || rooms.size() == 0) { return true; } int roomSize = rooms.size(); boolean[] visited = new boolean[roomSize]; openDoor(0, rooms, visited); int counter =0; for (int i=0; i