1 public class Solution {
 2     public int maxProfit(int[] prices) {
 3         int profit = 0;
 4         if (prices.length == 0 || prices.length == 1) return profit;
 5         for (int i = 1; i < prices.length; i++) {
 6             if (prices[i] <= prices[i-1]) continue;
 7             else {
 8                 profit += prices[i] - prices[i-1];
 9             }
10         }
11         return profit;
12     }
13 }