網址:https://leetcode.com/problems/container-with-most-water/
題意:
找兩條縱深線,然後利用x座標來計算容器面積.
分析:
先找最遠的兩頭,然後往中間收縮,
長變小了,高變長才能使面積可能更大.
所以就是找更長的...
解法:
如果height[left]<height[right],那麼就從left找比left高的,
反之,同理.
代碼:
https://github.com/LiLane/leetcode/blob/master/c%2B%2B/011-ContainerWithMostWater-201505181614.cpp
https://github.com/LiLane/leetcode/blob/master/java/011-ContainerWithMostWater-201505181612.java