Container With Most Water

标签：

Given n non-negative integers a₁, a₂, ..., a_n, where each represents a point at coordinate (i, a_i). n vertical lines are drawn such that the two endpoints of line i is at (i, a_i) 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.

#include<stdlib.h>
#include<stdio.h>

int maxArea(int height[], int n) {
    int i = 0, j = n-1, li ,lj;
    int max = 0, water;
    while(j > i) {
        water = (j - i) * ((height[i] < height[j])?height[i]:height[j]);
        //printf("i:%d,j:%d,water:%d\n",i, j, water);
        if(water > max) max = water;
        li = height[i];
        lj = height[j];
        if(lj < li) while(height[j] <= lj && j > i) j--;
        else while(height[i] <= li && j > i) i++;
    }
    return max;
}

void main() {
    int a[] = {2, 3, 4, 1};
    int n = 4;
    printf("%d\n", maxArea(a, n));
}

Container With Most Water

标签：

原文地址：http://blog.csdn.net/uj_mosquito/article/details/42297795