zoukankan      html  css  js  c++  java
  • 11.Container With Most Water (Array; Two-Pointers)

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

    思路:两个指针指向开头和结尾的位置,每次将矮的那侧的指针往中间移动,并且只关心比原来高的情况(因为宽度已经减小了,高度必须增高才可能面积变大)

    class Solution {
    public:
        int maxArea(vector<int>& height) {
            int size = height.size();
            int left = 0, right = height.size()-1;
            int maxLeft = 0, maxRight = 0;
            int ret = 0;
           
            while(left < right){
                if (height[left] < maxLeft) {
                    left++;
                    continue;
                }
                else maxLeft = height[left];
                if (height[right] < maxRight) {
                    right--;
                    continue;
                }
                else maxRight = height[right];
                ret = max(ret, min(height[left], height[right]) * (right - left));
                
                if(height[left] < height[right])  left++;
                else right--;
            }
            return ret;
        }
    };
  • 相关阅读:
    getopt 命令行参数解析
    Linux下使用indent整理代码
    终端常用快捷键
    gedit 乱码解决
    linux sysrq
    linux下的文件审计功能(audit inotify)
    gdb基本命令
    linux shell 字符截断
    linux 设置时间 date命令
    Ubuntu 时间同步
  • 原文地址:https://www.cnblogs.com/qionglouyuyu/p/4662568.html
Copyright © 2011-2022 走看看