LeetCode 11

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.

 

 1 /*************************************************************************
 2     > File Name: LeetCode011.c
 3     > Author: Juntaran
 4     > Mail: Jacinthmail@gmail.com
 5     > Created Time: Wed 27 Apr 2016 02:11:36 AM CST
 6  ************************************************************************/
 7  
 8 /*************************************************************************
 9 
10     Container With Most Water
11     
12     Given n non-negative integers a1, a2, ..., an, 
13     
14     where each represents a point at coordinate (i, ai). 
15     
16     n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). 
17     
18     Find two lines, which together with x-axis forms a container, 
19     
20     such that the container contains the most water.
21 
22     Note: You may not slant the container.
23 
24  ************************************************************************/
25  
26 #include <stdio.h>
27 
28 int maxArea(int* height, int heightSize) {
29     
30     int left = 0;
31     int right = heightSize - 1;
32     int max = 0;
33     
34     while( left < right ){
35         
36         int water = ( right - left ) * ( height[left] < height[right] ? height[left++] : height[right--] );
37         max = max > water ? max : water;
38         printf("Each water is %d\n", water);
39     }
40     printf("Max water is %d\n", max);
41     return max;
42     
43 }
44 
45 int main()
46 {
47     int heights[] = {4, 2, 1, 5, 6, 2, 0, 1};
48     int size = 8;
49     
50     maxArea( heights, size );
51     
52     return 0;
53 }

 

转载于:https://www.cnblogs.com/Juntaran/p/5437357.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值