首页 > 代码库 > Container With Most Water
Container With Most Water
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) 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
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。