Skip to content
Navigation Menu
Sign in
Products
Platform
GitHub
Repository hosting, code review, and collaboration
Copilot
AI coding agent for tasks, projects, and automated work
Build & Ship
Actions
CI/CD and automation
Code Quality
Quality analysis, fixes, and enforcement
Codespaces
Cloud development environments
Secure
Code Security
Vulnerability detection and remediation
Secret Protection
Secret scanning and leak prevention
All Features
Developers
Learn
Documentation
Training
Certifications
Build
Build with Copilot
Customize Copilot
Integrations
Explore
Trending repos
GitHub Sponsors
Developer articles
Changelog
Changelog
Your source for the latest features, improvements, and fixes across GitHub products, all in one place.
Businesses
By Stage
Enterprises
Team
Startups
Nonprofits
By Industry
Healthcare
Financial services
Manufacturing
Government
See all industries
Evaluate GitHub
Why GitHub
Customer Stories
Business insights
Trust Center
Add-ons
GitHub Advanced Security
Enterprise-grade code security
Copilot for business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Resources
Learn & Connect
Documentation
Resource center
Blog
Events & webinars
Community Forum
Customer Stories
Integrations
Support
Customer support
Training
GitHub Status
Company
About
Partners
Changelog
GitHub Universe
GitHub Universe
The event for developers, by developers — talks, workshops, and what’s next for GitHub.
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
gitYZHAO
Leetcode-Java
Repository navigation
Code
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
master
Breadcrumbs
Leetcode-Java
/
leetcode
/
solution
/
src
/
BurstBalloons.java
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
37 lines (34 loc) · 1.58 KB
master
Breadcrumbs
Leetcode-Java
/
leetcode
/
solution
/
src
/
BurstBalloons.java
Copy path
Top
File metadata and controls
Code
Blame
37 lines (34 loc) · 1.58 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
/**
* 这题用的闭区间DP,dp[start][end]表示区间start,end内所有气球爆掉的最大coin
* 假设最后爆第i个气球,start <= i <= end,则对应的coin为
* coin = nums[start - 1] * nums[i] * nums[end + 1] + dp[start, i - 1] + dp[i + 1][end]
* 为什么最后爆呢,因为这样以i为分隔线的左右两边就相互独立了,否则如果先爆i,则i的左右两个气球就相邻了
* 为什么最后爆i时,其相邻值取nums[start - 1]和nums[end + 1]呢?放在全局来看,就是nums[-1]和nums[n]都为1
*/
public
class
BurstBalloons
{
public
int
maxCoins
(
int
[]
nums
) {
if
(
nums
.
length
==
0
) {
return
0
;
}
int
n
=
nums
.
length
;
int
[][]
dp
=
new
int
[
n
][
n
];
for
(
int
len
=
1
;
len
<=
n
;
len
++) {
for
(
int
start
=
0
;
start
+
len
-
1
<
n
;
start
++) {
int
end
=
start
+
len
-
1
;
for
(
int
i
=
start
;
i
<=
end
;
i
++) {
int
coins
=
nums
[
i
] *
getValue
(
nums
,
start
-
1
) *
getValue
(
nums
,
end
+
1
);
coins
+=
i
>
start
?
dp
[
start
][
i
-
1
] :
0
;
// If not first one, we can add subrange on its left.
coins
+=
i
<
end
?
dp
[
i
+
1
][
end
] :
0
;
// If not last one, we can add subrange on its right
dp
[
start
][
end
] =
Math
.
max
(
dp
[
start
][
end
],
coins
);
}
}
}
return
dp
[
0
][
n
-
1
];
}
private
int
getValue
(
int
[]
nums
,
int
i
) {
// Deal with num[-1] and num[num.length]
if
(
i
<
0
||
i
>=
nums
.
length
) {
return
1
;
}
return
nums
[
i
];
}
}
You can’t perform that action at this time.