[LeetCode] Container With Most Water

http://oj.leetcode.com/problems/container-with-most-water/

从最外侧向内侧搜索, 在长度最长的情况下 保证高度尽量高. 注意如果左边第一个直线是所有直线里最长的情况.

所以我采用左右各遍历一次的方法a了.然后看了题解发现自己好弱智. 还是贴自己的沙茶代码吧.

class Solution {
public:
    int maxArea(vector<int> &height) {
        int re = 0;
        int cur = 0;
        int i = (int)height.size() - 1;
        while (cur < i) {
            if (height[i] >= height[cur]) {
                int t = (i - cur) * height[cur];
                re = t > re ? t : re;
                ++cur;
            } else {
                --i;
            }
        }
        cur = (int)height.size() - 1;
        i = 0;
        while (i < cur) {
            if (height[i] >= height[cur]) {
                int t = (cur - i) * height[cur];
                re = t > re ? t : re;
                --cur;
            } else {
                ++i;
            }
        }
        return re;
    }
};