leetcode鍒烽19

Posted 2022-09-12

鏍囩锛?a href='http://www.mamicode.com/so/1/class' title='class'>class   span   缁勫悎   style   tar   ret   i++   abs   鍨傜洿   

j浠婂ぉ鍒风殑棰樻槸Leecode绗?1棰橈紝棰樼洰瑕佹眰鏄細

缁欏畾n涓潪璐熸暣鏁帮紝姣忎釜鏁存暟浠ｈ〃涓€涓潗鏍?i,ai)锛屽湪鍧愭爣鍐呯敾n鏉″瀭鐩寸嚎
* 鍨傜洿绾縤鐨勪袱娈靛垎鍒槸i,ai鍜宨,0锛屾壘鍑哄叾涓殑涓ゆ潯绾匡紝浣垮緱鍥村煄鐨勯潰绉渶澶?br />棣栧厛鏄竴涓毚鍔涚畻娉曪紝鍗虫尐涓粍鍚堬紝鐪嬫€荤殑闈㈢Н閭ｄ釜缁勫悎鏈€澶э紝涓嬮潰鐨勪唬鐮佽€楁椂428ms锛屽唴瀛樻秷鑰?4.7MB銆備唬鐮佸涓嬶細

public static int getArea(int[] height)
        int area=Integer.MIN_VALUE;
        for (int i = 0; i <height.length ; i++) 
            for (int j = 0; j <i ; j++) 
                int nowarea=area(height,i,j);
                if (nowarea>area)
                    area=nowarea;
                
            
        
        return area;
    
    public static int area(int[]nums,int i,int j)
        return Math.abs(i-j)*Math.min(nums[i],nums[j]);
    

绗簩绉嶆柟娉曟槸鍙屾寚閽堥亶鍘嗭紝锛屼富瑕佺殑闅剧偣鍦ㄤ簬鎸囬拡鐨勭Щ鍔ㄣ€傚弻鎸囬拡涓紝绉诲姩杈冨皬鐨勯偅涓€傝€楁椂6ms锛屽唴瀛樻秷鑰?5.9MB

public static int getArea2(int[] height)
        int start=0;
        int end=height.length-1;
        int area=0;
        while (start<end)
            area=Math.max(area,(end-start)*Math.min(height[start],height[end]));
            if (height[start]<height[end])
                start++;
            else 
                end--;
            
        

        return area;