122.Best Time to Buy and Sell Stock II

标签：

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

Design an algorithm to find the maximum profit. You may complete as manytransactions as you like (ie, buy one and sell one share of the stock multipletimes). However, you may not engage in multiple transactions at the same time(ie, you must sell the stock before you buy again).

HideTags

 Array Greedy

#pragma once
#include<queue>
#include<iostream>
using namespace std;

int maxProfit(vector<int> &prices) {
	int sum = 0;
	int size = prices.size();
	int diff;
	for (int i = 1; i < size; i++)
	{
		diff = prices[i] - prices[i - 1];
		if (diff > 0)
			sum += diff;
	}
	return sum;
}

void main()
{
	vector<int> a = { 1, 4, 2, 3, 5, 6, 4, 8, 1 };
	cout << maxProfit(a) << endl;
	system("pause");

}

122.Best Time to Buy and Sell Stock II

标签：

原文地址：http://blog.csdn.net/hgqqtql/article/details/43278787