fix build

fishercoder1534 · fishercoder1534 · commit 8176b2f66ce0 · 2020-11-05T13:21:07.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_1381.java b/src/main/java/com/fishercoder/solutions/_1381.java
@@ -3,47 +3,6 @@
 import java.util.ArrayList;
 import java.util.List;
 
-/**
- * 1381. Design a Stack With Increment Operation
- *
- * Design a stack which supports the following operations.
- *
- * Implement the CustomStack class:
- *
- * CustomStack(int maxSize) Initializes the object with maxSize which is the maximum number of elements in the stack or do nothing if the stack reached the maxSize.
- * void push(int x) Adds x to the top of the stack if the stack hasn't reached the maxSize.
- * int pop() Pops and returns the top of stack or -1 if the stack is empty.
- * void inc(int k, int val) Increments the bottom k elements of the stack by val. If there are less than k elements in the stack, just increment all the elements in the stack.
- *
- * Example 1:
- *
- * Input
- * ["CustomStack","push","push","pop","push","push","push","increment","increment","pop","pop","pop","pop"]
- * [[3],[1],[2],[],[2],[3],[4],[5,100],[2,100],[],[],[],[]]
- * Output
- * [null,null,null,2,null,null,null,null,null,103,202,201,-1]
- * Explanation
- * CustomStack customStack = new CustomStack(3); // Stack is Empty []
- * customStack.push(1);                          // stack becomes [1]
- * customStack.push(2);                          // stack becomes [1, 2]
- * customStack.pop();                            // return 2 --> Return top of the stack 2, stack becomes [1]
- * customStack.push(2);                          // stack becomes [1, 2]
- * customStack.push(3);                          // stack becomes [1, 2, 3]
- * customStack.push(4);                          // stack still [1, 2, 3], Don't add another elements as size is 4
- * customStack.increment(5, 100);                // stack becomes [101, 102, 103]
- * customStack.increment(2, 100);                // stack becomes [201, 202, 103]
- * customStack.pop();                            // return 103 --> Return top of the stack 103, stack becomes [201, 202]
- * customStack.pop();                            // return 202 --> Return top of the stack 102, stack becomes [201]
- * customStack.pop();                            // return 201 --> Return top of the stack 101, stack becomes []
- * customStack.pop();                            // return -1 --> Stack is empty return -1.
- *
- * Constraints:
- * 1 <= maxSize <= 1000
- * 1 <= x <= 1000
- * 1 <= k <= 1000
- * 0 <= val <= 100
- * At most 1000 calls will be made to each method of increment, push and pop each separately.
- * */
 public class _1381 {
     public static class Solution1 {
         public static class CustomStack {
@@ -83,36 +42,43 @@ public void increment(int k, int val) {
     /**
      * Implementation of Stack using Array
      */
-    public static class Solution2{
+    public static class Solution2 {
         public static class CustomStack {
             private int top;
             private int maxSize;
             private int stack[];
+
             public CustomStack(int maxSize) {
                 this.maxSize = maxSize;
                 this.stack = new int[maxSize];
             }
 
             public void push(int x) {
-                if(top == maxSize) return;
+                if (top == maxSize) {
+                    return;
+                }
                 stack[top] = x;
                 top++;
             }
 
             public int pop() {
-                if(top == 0)
+                if (top == 0) {
                     return -1;
-                int popValue = stack[top-1];
-                stack[top-1] = 0;
+                }
+                int popValue = stack[top - 1];
+                stack[top - 1] = 0;
                 top--;
                 return popValue;
             }
 
             public void increment(int k, int val) {
-                if(top == 0 || k == 0) return;
-                for(int i = 0; i<k; i++){
-                    if(i == top)
+                if (top == 0 || k == 0) {
+                    return;
+                }
+                for (int i = 0; i < k; i++) {
+                    if (i == top) {
                         break;
+                    }
                     stack[i] += val;
                 }
             }
diff --git a/src/test/java/com/fishercoder/_1381Test.java b/src/test/java/com/fishercoder/_1381Test.java
@@ -25,6 +25,7 @@ public void test1() {
         assertEquals(201, customStack.pop());
         assertEquals(-1, customStack.pop());
     }
+
     @Test
     public void test2() {
         customStack2 = new _1381.Solution2.CustomStack(3);

Original file line number	Diff line number	Diff line change
`@@ -25,6 +25,7 @@ public void test1() {`
`25`	`25`	`assertEquals(201, customStack.pop());`
`26`	`26`	`assertEquals(-1, customStack.pop());`
`27`	`27`	`}`
	`28`	`+`
`28`	`29`	`@Test`
`29`	`30`	`public void test2() {`
`30`	`31`	`customStack2 = new _1381.Solution2.CustomStack(3);`