标签：des return and lsp ons cti 贪心法 tor class
Leetcode Problem-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).
题解：采用贪心法，低价进高价处，把所有正的价格差价相加起来。
|
class Solution { public: int maxProfit(vector<int>& prices) { int sum = 0; int dif = 0; for(int i = 1; i < prices.size();i++) { dif = prices[i] - prices[i-1]; if(dif > 0) sum += dif; } return sum; } }; |
Leetcode problem-122 Best Time to Buy and Sell Stock II 题解
标签：des return and lsp ons cti 贪心法 tor class
原文地址：http://www.cnblogs.com/fengxw/p/6061598.html
