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
/
368_javascript.js
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
65 lines (58 loc) · 1.65 KB
master
Breadcrumbs
Arithmetic
/
LeetCode
/
368_javascript.js
Copy path
Top
File metadata and controls
Code
Blame
65 lines (58 loc) · 1.65 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
56
57
58
59
60
61
62
63
64
65
// 给你一个由 无重复 正整数组成的集合 nums ,请你找出并返回其中最大的整除子集 answer ,子集中每一元素对 (answer[i], answer[j]) 都应当满足:
// answer[i] % answer[j] == 0 ,或
// answer[j] % answer[i] == 0
// 如果存在多个有效解子集,返回其中任何一个均可。
//
// 示例 1:
// 输入:nums = [1,2,3]
// 输出:[1,2]
// 解释:[1,3] 也会被视为正确答案。
// 示例 2:
// 输入:nums = [1,2,4,8]
// 输出:[1,2,4,8]
//
// 提示:
// 1 <= nums.length <= 1000
// 1 <= nums[i] <= 2 * 109
// nums 中的所有整数 互不相同
/**
* @param {number[]} nums
* @return {number[]}
*/
var largestDivisibleSubset = function (nums) {
nums.sort((a, b) => a - b);
// dp[i]为在i时最长的元素长度
let dp = new Array(nums.length).fill(1);
// 最大值时的索引值
let maxIndex = 0;
// 最大值时的dp[i]
let maxNum = 1;
for (let i = 1; i < nums.length; i++) {
let max = 0;
for (let j = 0; j < i; j++) {
if (nums[i] % nums[j] == 0) {
dp[i] = Math.max(dp[i], dp[j] + 1);
}
}
// 获取最大值的最后一个索引 例
// [1,2,3,4,5,6,7,12] 则获取12的索引
// 在遍历 第一位 到 索引地址 可以获得最大子数组
if (dp[i] > maxNum) {
maxNum = dp[i];
maxIndex = i;
}
}
let res = [];
// 获取最大子数组
// 1 2 3 4 5 6 7 12
//dp 1 2 2 3 2 3 2 4
for (let k = maxIndex; k >= 0; k--) {
if (nums[maxIndex] % nums[k] == 0 && dp[k] == maxNum) {
res.push(nums[k]);
maxNum--;
// 需更新maxIndex值
maxIndex = k;
}
}
return res;
};
You can’t perform that action at this time.