Best Time to Buy and Sell Stock II

xin_huang

于 2014-03-29 01:31:34 发布

阅读量690

点赞数

分类专栏： leetcode 文章标签： LeetCode

本文链接：https://blog.csdn.net/xhuang861030/article/details/22454851

版权

leetcode 专栏收录该内容

10 篇文章 0 订阅

订阅专栏

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

Link : 点击打开链接

This is a easy question, because you can buy and sell stock any times, so keep the stock when price[i+1] > price[i], otherwise sell the stock.

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