您的位置 首页 JAVA(2017)

LeetCode – 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).

这道题目有点trick,不过仔细想想,只要涨了就卖就行。

public class Solution {
    public int maxProfit(int[] prices) {
        int profit=0;
        for(int i=1;i<prices.length;i++){
            if(prices[i] > prices[i-1]){
                profit +=prices[i] - prices[i-1];
            }
        }
        return profit;
    }
}
看完了?留个评分呗?
[0人评了分,平均: 0/5]

本站原创文章皆遵循“署名-非商业性使用-相同方式共享 3.0 (CC BY-NC-SA 3.0)”。转载请保留以下标注:

原文来源:《LeetCode – 122. Best Time to Buy and Sell Stock II》

发表评论

电子邮件地址不会被公开。

返回顶部