[LeetCode] Best Time to Buy and Sell Stock II

最新推荐文章于 2024-10-05 12:29:44 发布

Noreasth

最新推荐文章于 2024-10-05 12:29:44 发布

阅读量821

点赞数

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

本文链接：https://blog.csdn.net/noreasth/article/details/9905487

版权

LeetCode 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Say you have an array for which the i^th 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).

这道题我的理解是找到数据中的局部最小值和最大值，在最小值是买入，在最大值是卖出。两个要点：

1.先买入，后卖出，也是要先找局部最小值

2.买入卖出的次数应该相等

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
    	int size=prices.size();
        if(size==0) return 0;
		int *newPrices=new int[size];
		int *maxPrices=new int[size];
		int *minPrices=new int[size];
		int n=0;
		int mx=0;
		int mn=0;
		for(int s=0;s<size;s++){//合并相同的点
			if(s<size-1&&prices[s]==prices[s+1]) continue;
			newPrices[n]=prices[s];
			n++;
		}
		if(newPrices[0]<newPrices[1]){// 分析首位置的情况
			minPrices[mn]=newPrices[0];
			mn++;
		}
		for(int i=1;i<n-1;i++){
			if(newPrices[i]>newPrices[i-1]&&newPrices[i]>newPrices[i+1]){
				maxPrices[mx]=newPrices[i];
				mx++;
			}
			if(newPrices[i]<newPrices[i-1]&&newPrices[i]<newPrices[i+1]){
				minPrices[mn]=newPrices[i];
				mn++;
			}
		}
		if(newPrices[n-1]>newPrices[n-2]){//分析末尾的情况
			maxPrices[mx]=newPrices[n-1];
			mx++;
		}
		else{
			minPrices[mn]=newPrices[n-1];
			mn++;
		}
		int sum_min=0;
		int sum_max=0;
		for(int i=0;i<mx;i++) sum_min+=minPrices[i];//注意这里同样是mx,因为最大利润只能是一买一卖，买卖次数是相同的
		for(int j=0;j<mx;j++) sum_max+=maxPrices[j];
		delete []newPrices;			
		delete []maxPrices;
		delete []minPrices;
		return (sum_max-sum_min); 
    }
};