zoukankan      html  css  js  c++  java
  • 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).

    public class Solution {
         /**
    	 * Multiple transactions are allowed. We solve it by greedy method.<br>
    	 * 
    	 * @param prices --an array of prices
    	 * @return profit 
    	 * @author Averill Zheng
    	 * @version 2014-06-04
    	 * @since JDK 1.7
    	 */
        public int maxProfit(int[] prices) {
            int profit = 0, length = prices.length;
            int buyDate = 0, sellDate = 0;
            for(int i = 1; i < length; ++i){
            	if(prices[i] >= prices[sellDate]){
            		profit += (prices[i] - prices[sellDate]);
            		sellDate = i;
            	}
            	if(prices[i] < prices[sellDate])
            		buyDate = sellDate = i;
            }
            return profit;    
        }
    }
    

      

  • 相关阅读:
    重装Win10系统的非常简单的操作教程
    Python
    Delphi
    Libs
    Windows Server
    Windows Server
    Delphi
    Delphi
    Delphi
    Delphi
  • 原文地址:https://www.cnblogs.com/averillzheng/p/3771646.html
Copyright © 2011-2022 走看看