求OJ container with most water O(n)解法# JobHunting - 待字闺中
w*x
1 楼
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.
[2,3,10,5,7,8,9] => 36 => 10...9
给个O(n)解法的思路??
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.
[2,3,10,5,7,8,9] => 36 => 10...9
给个O(n)解法的思路??