BestTimeToBuyAndSellStockWithTransactionFee::maxProfit2() - Code Metrics - imajinyun/leetcode-php - Measure and Improve Code Quality continuously with Scrutinizer

maxProfit2() A
last analyzed 2022-03-29 06:17 UTC

↳ Parent: BestTimeToBuyAndSellStockWithTransactionFee

Complexity

Conditions	3
Paths	3

Size

Total Lines	13
Code Lines	8

Duplication

Lines	0
Ratio	0 %

Importance

Changes	2
Bugs	0	Features	0

Metric	Value
eloc	8
c	2
b	0
f	0
dl	0
loc	13
rs	10
cc	3
nc	3
nop	2

<?php

declare(strict_types=1);

namespace leetcode;

class BestTimeToBuyAndSellStockWithTransactionFee
{
    public static function maxProfit(array $prices, int $fee): int
    {
        $n = count($prices);
        if ($n <= 0) {
            return 0;
        }
        $dp = array_fill(0, $n, [0, 0]);
        foreach ($prices as $i => $price) {
            if ($i - 1 < 0) {
                $dp[0][0] = 0;
                $dp[0][1] = -$price;
            } else {
                $dp[$i][0] = max($dp[$i - 1][0], $dp[$i - 1][1] + $price - $fee);
                $dp[$i][1] = max($dp[$i - 1][1], $dp[$i - 1][0] - $price);
            }
        }

        return $dp[$n - 1][0];
    }

    public static function maxProfit2(array $prices, int $fee): int
    {
        $n = count($prices);
        if ($n <= 0) {
            return 0;
        }
        [$cash, $hold] = [0, -$prices[0] - $fee];
        foreach ($prices as $i => $price) {
            $cash = max($cash, $hold + $price - $fee);
            $hold = max($hold, $cash - $price);
        }

        return $cash;
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			class BestTimeToBuyAndSellStockWithTransactionFee
8			{
9			public static function maxProfit(array $prices, int $fee): int
10			{
11			$n = count($prices);
12			if ($n <= 0) {
13			return 0;
14			}
15			$dp = array_fill(0, $n, [0, 0]);
16			foreach ($prices as $i => $price) {
17			if ($i - 1 < 0) {
18			$dp[0][0] = 0;
19			$dp[0][1] = -$price;
20			} else {
21			$dp[$i][0] = max($dp[$i - 1][0], $dp[$i - 1][1] + $price - $fee);
22			$dp[$i][1] = max($dp[$i - 1][1], $dp[$i - 1][0] - $price);
23			}
24			}
25
26			return $dp[$n - 1][0];
27			}
28
29			public static function maxProfit2(array $prices, int $fee): int
30			{
31			$n = count($prices);
32			if ($n <= 0) {
33			return 0;
34			}
35			[$cash, $hold] = [0, -$prices[0] - $fee];
36			foreach ($prices as $i => $price) {
37			$cash = max($cash, $hold + $price - $fee);
38			$hold = max($hold, $cash - $price);
39			}
40
41			return $cash;
42			}
43			}
44

imajinyun / leetcode-php

maxProfit2() A last analyzed 2022-03-29 06:17 UTC

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like

maxProfit2() A
last analyzed 2022-03-29 06:17 UTC