No122

Author: tujietg

leetcode/DP/No122.java

@@ -0,0 +1,14 @@
+class Solution {
+    public int maxProfit(int[] prices){
+        if(prices.length == 0 || prices.length == 1){
+            return 0;
+        }
+        int sum = 0;
+        for(int i = 0;i < prices.length - 1;i++){
+            if(prices[i+1] > prices[i]){
+                sum += prices[i+1] - prices[i];     
+            }
+        }
+    return sum;
+    }
+}