-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathBestTimeToBuyAndSellStockWithCooldown.php
More file actions
72 lines (64 loc) · 1.93 KB
/
BestTimeToBuyAndSellStockWithCooldown.php
File metadata and controls
72 lines (64 loc) · 1.93 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
<?php
declare(strict_types=1);
namespace leetcode;
class BestTimeToBuyAndSellStockWithCooldown
{
public static function maxProfit(array $prices): 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);
$dp[$i][1] = max($dp[$i - 1][1], ($dp[$i - 2][0] ?? 0) - $price);
}
}
return $dp[$n - 1][0];
}
public static function maxProfit2(array $prices): int
{
$n = count($prices);
if ($n <= 0) {
return 0;
}
$dp = array_fill(0, $n, [0, 0, 0]);
foreach ($prices as $i => $price) {
if ($i - 1 < 0) {
$dp[0][0] = 0;
$dp[0][1] = -$price;
$dp[0][2] = 0;
} else {
$dp[$i][0] = max($dp[$i - 1][0], $dp[$i - 1][1] + $price);
$dp[$i][1] = max($dp[$i - 1][1], $dp[$i - 1][2] - $price);
$dp[$i][2] = $dp[$i - 1][0];
}
}
return max($dp[$n - 1][0], $dp[$n - 1][2]);
}
public static function maxProfit3(array $prices): int
{
$n = count($prices);
if ($n <= 0) {
return 0;
}
$dp = array_fill(0, $n, 0);
[$cash, $hold] = [0, -$prices[0]];
foreach ($prices as $i => $price) {
if ($i - 1 < 0) {
[$dp[0], $dp[1], $dp[2]] = [0, -$price, 0];
} else {
$dp[0] = max($cash, $hold + $price);
$dp[1] = max($hold, $dp[2] - $price);
$dp[2] = $cash;
[$cash, $hold] = [$dp[0], $dp[1]];
}
}
return max($dp[0], $dp[2]);
}
}