[LeetCode] 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).

 

这道跟之前那道Best Time to Buy and Sell Stock 买卖股票的最佳时间很类似，但都比较容易解答。这道题由于可以无限次买入和卖出。我们都知道炒股想挣钱当然是低价买入高价抛出，那么这里我们只需要从第二天开始，如果当前价格比之前价格高，则把差值加入利润中，因为我们可以昨天买入，今日卖出，若明日价更高的话，还可以今日买入，明日再抛出。以此类推，遍历完整个数组后即可求得最大利润。代码如下：

public static int maxProfit(int[] prices) {
		int res = 0;
		for (int i = 0; i < prices.length - 1; ++i) {
			if (prices[i] < prices[i + 1]) {
				res += prices[i + 1] - prices[i];
			}
		}

		return res;
	}

题目描述

 

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

If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.

假设有一个数组，其中第i个元素是某只股票在第i天的价格。

如果你最多只能完成一笔交易(即买一股和卖一股股票)，设计一个算法来找出最大利润。

 

 public int maxProfit(int[] prices) {
        
	    	int low = Integer.MAX_VALUE;
	    	int profit = 0 ;
	    	for (int i = 0; i < prices.length; i++) {
				if(prices[i] < low)	low = prices[i];
				else if(prices[i]- low > profit)	profit = prices[i]- low;
			}
	    	
	    	return profit;
	        
	    
    }