zoukankan      html  css  js  c++  java
  • 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.

    题意

    从给定数组a[i]中找出 i。j使得 abs(j-i)*min(a[i],a[j])值最大

    思路

    刚開始使用两重循环,o(n^2),超时。改为贪心思想,每次仅仅尝试有可能更优的解。终于遍历完后,时间复杂度o(n);
    详细步骤 设i位于序列首。j位于序列尾。则若a[i]

    int maxArea(int* height, int heightSize) 
    {
        int max=0,f,a,i=0,j=heightSize-1;
        while(i<j)
        {
            f=height[i]<height[j]?

    1:0; if(f) { a=(j-i)*height[i]; i++; } else { a=(j-i)*height[j]; j--; } if(a>max) { max=a; } } return max; }

  • 相关阅读:
    适配器
    策略
    oom的各种情况
    sql 优化//TODO
    聚簇索引和非聚簇索引
    Shard内部原理
    es集群健康状态
    转载 R语言颜色基础设置
    三维数据的展示
    python 文件保存 出错
  • 原文地址:https://www.cnblogs.com/yjbjingcha/p/7205713.html
Copyright © 2011-2022 走看看