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 }}
AhkunTa
Arithmetic
Repository navigation
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
master
Breadcrumbs
Arithmetic
/
LeetCode
/
673_javascript.js
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
55 lines (49 loc) · 1.56 KB
master
Breadcrumbs
Arithmetic
/
LeetCode
/
673_javascript.js
Copy path
Top
File metadata and controls
Code
Blame
55 lines (49 loc) · 1.56 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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
// 给定一个未排序的整数数组,找到最长递增子序列的个数。
// 示例 1:
// 输入: [1,3,5,4,7]
// 输出: 2
// 解释: 有两个最长递增子序列,分别是 [1, 3, 4, 7] 和[1, 3, 5, 7]。
// 示例 2:
// 输入: [2,2,2,2,2]
// 输出: 5
// 解释: 最长递增子序列的长度是1,并且存在5个子序列的长度为1,因此输出5。
// 注意: 给定的数组长度不超过 2000 并且结果一定是32位有符号整数。
// 此题为 300 题的变形
// 2021.09.20 每日一题
/**
* @param {number[]} nums
* @return {number}
*/
var findNumberOfLIS = function (nums) {
// dp[i] 为到 i 的最长字序列的长度
let dp = new Array(nums.length).fill(0);
// record[i] 表示以 nums[i] 结尾的最长递增子序列的个数
let record = new Array(nums.length).fill(0);
// max 记录最长子序列长度
let max = 0;
let res = 0;
dp[0] = record[0] = 1;
for (let i = 0; i < nums.length; i++) {
dp[i] = record[i] = 1;
for (let j = 0; j < i; j++) {
if (nums[i] > nums[j]) {
// i 之前的最长子序列的长度加一
if (dp[j] + 1 > dp[i]) {
dp[i] = dp[j] + 1;
record[i] = record[j];
// 之前的最长子序列长度加一 等于 当前的最长子序列长度
// 即子序列长度相等 则个数相加
} else if (dp[j] + 1 == dp[i]) {
record[i] += record[j];
}
}
}
if (dp[i] > max) {
max = dp[i];
res = record[i];
} else if (dp[i] == max) {
res += record[i];
}
}
return res;
};
You can’t perform that action at this time.