refactor 122

fishercoder1534 · fishercoder1534 · commit b25a83462b23 · 2021-11-10T07:30:43.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_122.java b/src/main/java/com/fishercoder/solutions/_122.java
@@ -22,7 +22,13 @@ public int maxProfit(int[] prices) {
     }
 
     public static class Solution2 {
-        //simple one pass approach: the above solution could be simplied as below
+        //simple one pass approach: the above solution could be simplified as below
+
+        /**
+         * Or this approach could be understood as:
+         * We'll sell and buy on the same day as long as this day's stock price is higher than the previous day, a good example is this array: [1, 2, 3, 4, 5].
+         * As this problem states that:"you can buy it then immediately sell it on the same day". Likewise, we can buy it back immediately as we sell it on the same day.
+         */
         public int maxProfit(int[] prices) {
             int pro = 0;
             for (int i = 0; i < prices.length - 1; i++) {
