public class No11 {public static void main(String[] args) {int[] height = { 3, 4, 5 ,3};System.out.println(maxArea(height));}public static int maxArea(int[] height) {int left=0;int right=height.length-1;int max=0;int size=0;while(left<right){size=(right-left)*Math.min(height[left], height[right]);max=max>size?max:size;if(height[left]>height[right])right--;elseleft++;}return max;}}
[https://leetcode-cn.com/problems/container-with-most-water/][https_leetcode-cn.com_prob
Topic Array Two Pointers Description [https://leetcode.com/problems/contain
public class No11 { public static void main(String[] args) {
题目： Given n non-negative integers a1, a2, ..., an, where each represents a point at c
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordina
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordina
1. 概述 Given n non-negative integers a1, a2, ..., an, where each represents a point at
Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordina
试题： Given n non-negative integers a1, a2, ..., an , where each represents a point a
谁借莪１个温暖的怀抱￠
柔情只为你懂
我会带着你远行
àì夳堔傛蜴生んèń
Myth丶恋晨
今天药忘吃喽~
╰+哭是因爲堅強的太久メ
还没有评论，来说两句吧...