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 }}
HiTutorial
LeetCode
Repository navigation
Code
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
master
Breadcrumbs
LeetCode
/
question0053_maximum_subarray
/
Solution3.java
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
31 lines (30 loc) · 909 Bytes
master
Breadcrumbs
LeetCode
/
question0053_maximum_subarray
/
Solution3.java
Copy path
Top
File metadata and controls
Code
Blame
31 lines (30 loc) · 909 Bytes
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
package
question0053_maximum_subarray
;
/**
* 动态规划。
*
* 状态定义:
* dp[i]:以第i个数字结尾的子数组的最大和。
*
* 状态转移:
* (1)如果i == 0或dp[i - 1] <= 0,dp[i] = nums[i]。
* (2)否则,dp[i] = dp[i - 1] + nums[i]。
*
* 由于dp[i]仅依赖于dp[i - 1],故可以进行状态压缩,用一个变量来代替dp数组。
*
* 时间复杂度是O(n),其中n是nums数组的长度。空间复杂度是O(1)。
*
* 执行用时:2ms,击败97.99%。消耗内存:39.2MB,击败75.98%。
*/
public
class
Solution3
{
public
int
maxSubArray
(
int
[]
nums
) {
int
n
=
nums
.
length
,
result
=
Integer
.
MIN_VALUE
,
sum
=
0
;
for
(
int
i
=
0
;
i
<
n
;
i
++) {
sum
+=
nums
[
i
];
result
=
Math
.
max
(
result
,
sum
);
if
(
sum
<
0
) {
sum
=
0
;
}
}
return
result
;
}
}
You can’t perform that action at this time.