public List<Integer> largestDivisibleSubset(int[] nums) {
List<Integer> res = new ArrayList<>();
if (nums == null || nums.length == 0) {
int[] count = new int[n];
int[] preIndex = new int[n];
for (int i = 0; i < n; i++) {
for (int j = i - 1; j >= 0; j--) {
if (nums[i] % nums[j] == 0 && (1 + count[j] > count[i])) {