Largest Divisible Subset

public class Solution {
    public List<Integer> largestDivisibleSubset(int[] nums) {
        List<Integer> result = new ArrayList<>();
        if (nums.length == 0) {
            return result;
        }
        
        int[] dp = new int[nums.length];
        int[] parent = new int[nums.length];
        int maxNum = 0;
        int maxIndex = -1;
        Arrays.sort(nums);
        for (int i = nums.length - 1; i >= 0; i--) {
            parent[i] = i;
            for (int j = i; j < nums.length; j++) {
                if (nums[j] % nums[i] == 0 && dp[i] < dp[j] + 1) {
                    dp[i] = dp[j] + 1;
                    parent[i] = j;
                    
                    if (dp[i] > maxNum) {
                        maxNum = dp[i];
                        maxIndex = i;
                    }
                }
            }
        }
        while (maxNum-- > 0) {
            result.add(nums[maxIndex]);
            maxIndex = parent[maxIndex];
        }
        return result;
    }
}