refactor 11

fishercoder1534 · fishercoder1534 · commit abcbc54300d7 · 2020-04-26T11:33:21.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_11.java b/src/main/java/com/fishercoder/solutions/_11.java
@@ -1,17 +1,6 @@
 package com.fishercoder.solutions;
 
-/**
- * 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 and n is at least 2.
- */
 public class _11 {
-
     public static class Solution1 {
         public int maxArea(int[] height) {
             int max = 0;
