LeetCode_Best Time to Buy and Sell Stock II

最新推荐文章于 2024-11-06 22:56:21 发布

原创最新推荐文章于 2024-11-06 22:56:21 发布 · 1.4k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#C++ #算法题 #leetcode

Something_Interesting 同时被 3 个专栏收录

174 篇文章

订阅专栏

C++

88 篇文章

订阅专栏

Leetcode

45 篇文章

订阅专栏

本文介绍了一种使用贪心算法解决无限次股票买卖问题的方法，旨在通过每日交易来最大化收益。详细解释了算法原理，并提供了实现代码。通过实践案例，帮助读者理解并掌握这一经典算法。

一.题目

Best Time to Buy and Sell Stock II

My Submissions

Total Accepted: 68509 Total Submissions: 170952 Difficulty: Medium

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).

Subscribe to see which companies asked this question

Show Tags

Show Similar Problems

Have you met this question in a real interview?

Yes

Discuss

二.解题技巧

这道题可以用贪心法来做，由于不限制次数，可以每一天都进行交易，然后将所有收入为正的部分都加起来，就是所获得的最大收益。

三.实现代码

#include <vector>

using std::vector;

class Solution
{
public:
    int maxProfit(vector<int>& prices)
    {
        if (prices.empty())
        {
            return 0;
        }


        if (prices.size() == 1)
        {
            return 0;
        }

        int Result = 0;
        int Tmp = 0;
        for (vector<int>::iterator Ite = prices.begin(); Ite != prices.end() - 1;
             ++Ite)
        {

            Tmp = *(Ite + 1) - *Ite;

            if (Tmp > 0)
            {
                Result += Tmp;
            }
        }

        return Result;
    }
};