Create 368-largest-divisible-subset.js

Author: everthis

368-largest-divisible-subset.js

@@ -0,0 +1,30 @@
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+const largestDivisibleSubset = function(nums) {
+  let len = nums.length;
+  let m = 0;
+  let mi;
+  const T = new Array(len).fill(0);
+  const son = new Array(len).fill(0);
+  nums.sort((a, b) => a - b);
+  for (let i = 0; i < len; i++) {
+    for (let j = i; j >= 0; j--) {
+      if (nums[i] % nums[j] === 0 && T[j] + 1 > T[i]) {
+        T[i] = T[j] + 1;
+        son[i] = j;
+      }
+    }
+    if (T[i] > m) {
+      m = T[i];
+      mi = i;
+    }
+  }
+  const re = [];
+  for (let i = 0; i < m; i++) {
+    re.unshift(nums[mi]);
+    mi = son[mi];
+  }
+  return re;
+};