leetcode 368. Largest Divisible Subset（最大可除子集）

Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies:

Si % Sj = 0 or Sj % Si = 0.

If there are multiple solutions, return any subset is fine.

Example 1:

Input: [1,2,3]
Output: [1,2] (of course, [1,3] will also be ok)
Example 2:

Input: [1,2,4,8]
Output: [1,2,4,8]

给出一个正数的集合，找出两两可除的最大集合

思路：
DP，用dp数组定义每个index处对应的最大集合的长度，初始值都是1
因为最后要输出的不是最大的长度，而是数字集，因此要保存路径

而且如果a整除b，b整除c，那么a整除c，也就是说只需要看能不能被最大的数整除就行，所以需要先把数组排序。

    public List<Integer> largestDivisibleSubset(int[] nums) {
        List<Integer> result = new ArrayList<>();
        if (nums == null || nums.length == 0) {
            return result;
        }
        
        if (nums.length == 1) {
            result.add(nums[0]);
            return result;
        }
        
        int[] dp = new int[nums.length];
        int[] path = new int[nums.length];
        int maxIndex = 0;
        
        Arrays.sort(nums);
        
        for(int i = 0; i < nums.length; i++) {
            dp[i] = 1;
            path[i] = -1;
            
            for(int j = i-1; j >= 0; j--) {
                if (nums[i] % nums[j] == 0) {
                    if (dp[i] < (dp[j] + 1)) {
                        dp[i] = dp[j] + 1;
                        if (dp[i] > dp[maxIndex]) {
                            maxIndex = i;
                        }
                        path[i] = j;
                    } 
                } 
            }
            
        }
        
        int index = maxIndex;
        while(index != -1) {
            result.add(nums[index]);
            index = path[index];
        }
        
        return result;
    }