Create Largest Divisible Subset

Author: gs146

Largest Divisible Subset

@@ -0,0 +1,42 @@
+class Solution {
+public:
+    vector<int> largestDivisibleSubset(vector<int>& nums) 
+    {
+        vector<int> res;
+        
+        int n = nums.size();
+        
+        if(n==0)
+            return res;
+        sort(nums.begin(), nums.end());
+        vector<int> div_cnt(n,1);      
+        vector<int> prev(n,-1);
+        
+        int max_idx = 0;
+        
+        for(int i=1;i<n;i++)
+        {
+            for(int j=0;j<i;j++)
+            {
+                if(nums[i]%nums[j] == 0)
+                {
+                    if(div_cnt[i] < div_cnt[j]+1)
+                    {
+                        div_cnt[i] = div_cnt[j]+1;
+                        prev[i] = j;
+                    }
+                }
+            }
+            if(div_cnt[max_idx] < div_cnt[i])
+                max_idx = i;
+        }
+        
+        while(max_idx >= 0)
+        {
+            res.push_back(nums[max_idx]);
+            max_idx = prev[max_idx];
+        }
+        reverse(res.begin(), res.end());
+        return res;
+    }
+};