[Leetcode] best time to Buy and Sell Stock II

Title: Given an array of shapes, indicating stock movements, stocks can buy and sell at random times. The maximum profit that can be saved

Algorithm: the equivalent of the rise in the stock trend sum

For example: Stock trend: 1,1,3,2,5,7,1,3,2,0. The maximum profit is (3-1) + (5-2) + (7-5) + (3-1) =9

public class Solution {public    int maxprofit (int[] prices) {    if (0 = = prices.length) {    //Empty array    Retu RN 0;    }            int maxprofile = 0;        int sellin = prices[0];        for (int i=1; i<prices.length; ++i) {        if (Prices[i] > Sellin) {        Maxprofile + = (Prices[i]-sellin);        Sellin = Prices[i];        } else {        Sellin = prices[i];        }        }        return maxprofile;}    }

[Leetcode] best time to Buy and Sell Stock II