We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 1582b0c commit 2a3b9deCopy full SHA for 2a3b9de
368-largest-divisible-subset.js
@@ -7,6 +7,7 @@ const largestDivisibleSubset = function(nums) {
7
let m = 0;
8
let mi;
9
const T = new Array(len).fill(0);
10
+ // T[n] should be the length of the largest divisible subset whose smallest number is a[n]
11
const son = new Array(len).fill(0);
12
nums.sort((a, b) => a - b);
13
for (let i = 0; i < len; i++) {
0 commit comments