![thumbnail](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FyiJX0%2FbtqBpglSy0U%2FoQVb40PaEVSjKMWZ2a0rl0%2Fimg.png)
[Python/LeetCode]코딩테스트 준비를 위한 파이썬 알고리즘 문제 11. Container With Most Water 해설(Medium level)
2020. 1. 21. 12:23
알고리즘 문제
문제 11. Container With Most Water Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water. Note: You may not slant the container and n is at least 2. Loo..