public int maxProfit(int[] prices) {
  int maxProfit = 0;

  for (int i = 1; i < prices.lentgh; i++) {
    if (prices[i] > prices[i -1]) {
      maxProfit += (prices[i] - prices[i -1]);
    }
  }
  return maxProfit;
}