refactor 84

fishercoder1534 · fishercoder1534 · commit 25cca29bcff3 · 2018-02-21T09:17:12.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_84.java b/src/main/java/com/fishercoder/solutions/_84.java
@@ -19,23 +19,28 @@
  */
 public class _84 {
 
-    /**credit: https://leetcode.com/articles/largest-rectangle-histogram/#approach-5-using-stack-accepted
-     * and https://discuss.leetcode.com/topic/7599/o-n-stack-based-java-solution*/
+  public static class Solution1 {
+
+    /**
+     * credit: https://leetcode.com/articles/largest-rectangle-histogram/#approach-5-using-stack-accepted
+     * and https://discuss.leetcode.com/topic/7599/o-n-stack-based-java-solution
+     */
     public int largestRectangleArea(int[] heights) {
-        int len = heights.length;
-        Stack<Integer> s = new Stack<>();
-        int maxArea = 0;
-        for (int i = 0; i <= len; i++) {
-            int h = (i == len ? 0 : heights[i]);
-            if (s.isEmpty() || h >= heights[s.peek()]) {
-                s.push(i);
-            } else {
-                int tp = s.pop();
-                maxArea = Math.max(maxArea, heights[tp] * (s.isEmpty() ? i : i - 1 - s.peek()));
-                i--;
-            }
+      int len = heights.length;
+      Stack<Integer> s = new Stack<>();
+      int maxArea = 0;
+      for (int i = 0; i <= len; i++) {
+        int h = (i == len ? 0 : heights[i]);
+        if (s.isEmpty() || h >= heights[s.peek()]) {
+          s.push(i);
+        } else {
+          int tp = s.pop();
+          maxArea = Math.max(maxArea, heights[tp] * (s.isEmpty() ? i : i - 1 - s.peek()));
+          i--;
         }
-        return maxArea;
+      }
+      return maxArea;
     }
+  }
 
 }
