목록탐욕법 (1)
심플하게 개발하기

리트코드 11번 문제. 난이도: Medium 리트코드 링크 https://leetcode.com/problems/container-with-most-water/description/ 문제 You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that together with the x-axis form a container, such that the container contains the most water. Return the maximum amo..
코딩공부/리트코드
2022. 10. 14. 16:04