LeetCode (力扣) 11. Container With Most Water ( C ) - Medium - 双指针法

同步发于 JuzerTech 网站，里面有我软、硬件学习的纪录与科技产品开箱，欢迎进去观看。

题目为给定一串数字与此字符串长度，每个数字对应座标点的 y 值，两条线围起来的区域计算面积，找最大面积，并回传。

 

题目与范例如下

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 the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.

Notice that you may not slant the container.



Example 1:


Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.
Example 2:

Input: height = [1,1]
Output: 1
Example 3:

Input: height = [4,3,2,1,4]
Output: 16
Example 4:

Input: height = [1,2,1]
Output: 2

 

解题方法为从左边跟右边逼近，比较小的边往内逼近。

原理不容易直觀上的理解，這邊有人解說得很詳細 Like

 

下方为我的代码

int maxArea(int* height, int heightSize){
    int left = 0,right = heightSize -1;
    int MaxArea = 0,TempArea;
    while(left<right){
        if(height[left] < height[right]){
            TempArea = (right-left)*height[left];
            if( TempArea > MaxArea)
                MaxArea = TempArea;
            left++;
        }
        else{
            TempArea = (right-left)*height[right];
            if(TempArea > MaxArea)
                MaxArea = TempArea;
            right--;            
        }
        
    }
    return MaxArea;
}

 

下方为时间与空间之消耗

Runtime: 76 ms, faster than 70.80 % of C online submissions for Container With Most Water.

Memory Usage: 11.6 MB, less than 86.88 % of C online submissions for Container With Most Water.