Sunday, July 12, 2020

public class Solution

public class Solution { public int maxArea(int[] height) { int maxarea = 0; for (int i = 0; i < height.length; i++) for (int j = i + 1; j < height.length; j++) maxarea = Math.max(maxarea, Math.min(height[i], height[j]) * (j - i)); return maxarea; } }

eieiriri

lkezjlker zerpoer npozer zeporze nrpo zerpon zerpo