LeetCode: Container With Most Water

第一次用了个O（n^2)的算法large没过，就仔细想了想，少数次过吧

class Solution {
public:
    int maxArea(vector<int> &height) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int sum = 0;
        int beg = 0;
        int end = height.size()-1;
        while (beg < end) {
            sum = max(sum, min(height[beg], height[end])*(end-beg));
            if (height[beg] > height[end]) end--;
            else beg++;
        }
        return sum;
    }
};

 C#

public class Solution {
    public int MaxArea(int[] height) {
        int sum = 0;
        int beg = 0;
        int end = height.Length - 1;
        while (beg < end) {
            sum = Math.Max(sum, Math.Min(height[beg], height[end]) * (end - beg));
            if (height[beg] > height[end]) end--;
            else beg++;
        }
        return sum;
    }
}