122. Best Time to Buy and Sell Stock II

Say you have an array for which the ith element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

 

复制代码
public class Solution {
    public int maxProfit(int[] prices) {
        int total = 0;
        for(int i = 1; i < prices.length ; i++){
            if(prices[i] > prices[i-1]) total += prices[i] - prices[i-1];
        }
        return total;
    }
}
复制代码

 

posted @   微微程序媛  阅读(105)  评论(0编辑  收藏  举报
努力加载评论中...
点击右上角即可分享
微信分享提示