新学的算法预知未来者算法求买股票最大利润问题，后者大于前者则进行处理

Posted 2022-12-22 z2529827226

package com.Long


class Solution 
	private int Max=0;
	
    public int maxProfit(int[] prices) 
        for(int i=1;i<prices.length;++i) 
        	if(prices[i]-prices[i-1]>0) 
        		Max+=prices[i]-prices[i-1];
        	
        
        return Max;
    



public class Main
	public static void main(String[] args)