动态规划之最大面积(C++实现)

LeetCode 链接：https://leetcode-cn.com/problems/container-with-most-water/

class Solution {
public:
	int maxArea(vector<int>& height) {
		int total_max = 0;
		int j =  height.size()-1;
		int i = 0;
		while (j >= i)
		{
			total_max = max(total_max,(j-i)*min(height[i],height[j]));
			if (height[i] < height[j])
			{
				i++;
			}
			else
			{
				j--;
			}
		}
		return total_max;
	}
};