基于java计算买卖股票的最佳时机

package com.example.demo;public class Test121 {  /**   * 多个   *   * @param prices   * @return   */  public int maxProfit(int[] prices) {    if (prices == null || prices.length == 0) {      return 0;    }    int cur = 0;    int vally = prices[0];    int peak = 0;    int income = 0;    while (cur < prices.length - 1) {      //找到卖出点,谷底      while (cur < prices.length - 1 && prices[cur] >= prices[cur + 1]) {        cur++;      }      vally = prices[cur];      //找到比当前大的值（即最高点,顶峰）      while (cur < prices.length - 1 && prices[cur] <= prices[cur + 1]) {        cur++;      }      peak = prices[cur];      income += peak - vally;      //如果此时cur仍然没有到最后，则进行再一次循环    }    return income;  }  public static void main(String[] args) {    Test121 t = new Test121();    int[] arr = {7, 1, 5, 3, 6, 4};    int i = t.maxProfit(arr);    System.out.println(i);  }}