LeetCode--最多盛水量(提交成功，时间复杂度较高且空间复杂度较高)

MouCoder · MouCoder · commit a64bb131cba8 · 2020-08-19T19:47:59.000+08:00
diff --git a/water/Solution.java b/water/Solution.java
@@ -0,0 +1,17 @@
+package LeetCode.Array.water;
+
+public class Solution {
+    public int maxArea(int[] height) {
+        int max = 0,min = 0;
+        for(int i = 0;i < height.length - 1;i++)
+            for(int j = i+1;j < height.length;j++){
+                if(height[i] < height[j])
+                    min = height[i];
+                else min = height[j];
+                if(max < (j - i)*min)
+                    max = (j - i)*min;
+            }
+        return max;
+    }
+}
+//{1,8,6,2,5,4,8,3,7}
diff --git a/water/Test.java b/water/Test.java
@@ -0,0 +1,9 @@
+package LeetCode.Array.water;
+
+public class Test {
+    public static void main(String[] args) {
+        Solution sol = new Solution();
+        int[] height = {1,8,6,2,5,4,8,3,7};
+        System.out.println(sol.maxArea(height));
+    }
+}
