LeetCode-714. Best Time to Buy and Sell Stock with Transaction Fee [C++][Java]

LeetCode-714. Best Time to Buy and Sell Stock with Transaction FeeLevel up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/

题目描述

You are given an array prices where prices[i] is the price of a given stock on the ith day, and an integer fee representing a transaction fee.

Find the maximum profit you can achieve. You may complete as many transactions as you like, but you need to pay the transaction fee for each transaction.

Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).

Example 1:

Input: prices = [1,3,2,8,4,9], fee = 2
Output: 8
Explanation: The maximum profit can be achieved by:
- Buying at prices[0] = 1
- Selling at prices[3] = 8
- Buying at prices[4] = 4
- Selling at prices[5] = 9
The total profit is ((8 - 1) - 2) + ((9 - 4) - 2) = 8.

Example 2:

Input: prices = [1,3,7,5,10,3], fee = 3
Output: 6

Constraints:

  • 1 <= prices.length <= 5 * 10^4
  • 1 <= prices[i] < 5 * 10^4
  • 0 <= fee < 5 * 10^4

解题思路

【C++】

class Solution {
public:
    int maxProfit(vector<int>& prices, int fee) {
        int cash = 0, hold = 0;
        for (int i = 1; i < prices.size(); i++) {
            int grow = prices[i] - prices[i-1];
            int c = max(cash, hold + grow - fee);
            int h = max(cash, hold + grow);
            cash = c;
            hold = h;
        } 
        return cash;    // all cash as profit 
    }
};

【Java】

class Solution {
    public int maxProfit(int[] prices, int fee) {
        int cash = 0, hold = 0;
        for (int i = 1; i < prices.length; i++) {
            int grow = prices[i] - prices[i-1];
            int c = Math.max(cash, hold + grow - fee);
            int h = Math.max(cash, hold + grow);
            cash = c;
            hold = h;
        } 
        return cash;    // all cash as profit 
    }
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

贫道绝缘子

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值