tobeexpert
diff --git a/‎src/main/java/com/fishercoder/solutions/_121.java
Lines changed: 19 additions & 17 deletions b/‎src/main/java/com/fishercoder/solutions/_121.java
Lines changed: 19 additions & 17 deletions
diff --git a/‎src/test/java/com/fishercoder/_121Test.java
Lines changed: 32 additions & 33 deletions b/‎src/test/java/com/fishercoder/_121Test.java
Lines changed: 32 additions & 33 deletions
@@ -24,24 +24,26 @@
 
 public class _121 {
 
-    /**
-     * The key here is that you'll have to buy first, before you can sell.
-     * That means, if the lower price comes after a higher price, their combination won't work! Since you cannot sell first
-     * before you buy it.
-     */
-    public int maxProfit(int[] prices) {
-        if (prices == null || prices.length == 0) {
-            return 0;
-        }
-        int buy = prices[0];
-        int maxProfit = 0;
-        for (int i = 1; i < prices.length; i++) {
-            if (prices[i] < buy) {
-                buy = prices[i];
-            } else {
-                maxProfit = Math.max(maxProfit, prices[i] - buy);
+    public static class Solution1 {
+        /**
+         * The key here is that you'll have to buy first, before you can sell. That means, if the lower
+         * price comes after a higher price, their combination won't wo
8000
rk! Since you cannot sell first
+         * before you buy it.
+         */
+        public int maxProfit(int[] prices) {
+            if (prices == null || prices.length == 0) {
+                return 0;
+            }
+            int buy = prices[0];
+            int maxProfit = 0;
+            for (int i = 1; i < prices.length; i++) {
+                if (prices[i] < buy) {
+                    buy = prices[i];
+                } else {
+                    maxProfit = Math.max(maxProfit, prices[i] - buy);
+                }
             }
+            return maxProfit;
         }
-        return maxProfit;
     }
 }
@@ -7,36 +7,35 @@
 import static junit.framework.Assert.assertEquals;
 
 public class _121Test {
-    private static _121 test;
-    private static int[] prices;
-
-    @BeforeClass
-    public static void setup() {
-        test = new _121();
-    }
-
-    @Test
-    public void test1() {
-        prices = new int[]{7, 1, 5, 3, 6, 4};
-        assertEquals(5, test.maxProfit(prices));
-    }
-
-    @Test
-    public void test2() {
-        prices = new int[]{7, 6, 4, 3, 1};
-        assertEquals(0, test.maxProfit(prices));
-    }
-
-    @Test
-    public void test3() {
-        prices = new int[]{2, 4, 1};
-        assertEquals(2, test.maxProfit(prices));
-    }
-
-    @Test
-    public void test4() {
-        prices = new int[]{1, 2};
-        assertEquals(1, test.maxProfit(prices));
-    }
-
-}
+  private static _121.Solution1 solution1;
+  private static int[] prices;
+
+  @BeforeClass
+  public static void setup() {
+    solution1 = new _121.Solution1();
+
+  @Test
+  public void test1() {
+    prices = new int[] {7, 1, 5, 3, 6, 4};
+    assertEquals(5, solution1.maxProfit(prices));
+  }
+
+  @Test
+  public void test2() {
+    prices = new int[] {7, 6, 4, 3, 1};
+    assertEquals(0, solution1.maxProfit(prices));
+  }
+
+  @Test
+  public void test3() {
+    prices = new int[] {2, 4, 1};
+    assertEquals(2, solution1.maxProfit(prices));
+  }
+
+  @Test
+  public void test4() {
+    prices = new int[] {1, 2};
+    assertEquals(1, solution1.maxProfit(prices));
+  }
+}