classSolution {

funlargestDivisibleSubset(nums:IntArray):List<Int> {

val n= nums.size

nums.sort()

val dp= nums

.map {listOf(it) }

.toTypedArray()

var res= listOf<Int>()

for (iin n-1 downTo0) {

for (jin i+1 until n) {

if (nums[j]% nums[i]==0) {

val temp=listOf(nums[i])+ dp[j]

dp[i]=if (temp.size> dp[i].size) tempelse dp[i]

}

}

res=if (dp[i].size> res.size) dp[i]else res

}

return res

}

}

classSolution {

funlargestDivisibleSubset(nums:IntArray):List<Int> {

val n= nums.size

nums.sort()

val dp=HashMap<Int,List<Int>>()

fundfs(i:Int):List<Int> {

if (i== n)returnlistOf()

dp[i]?.let {return it }

var res=listOf(nums[i])

for (jin i+1 until n) {

if (nums[j]% nums[i]==0) {

val temp=listOf(nums[i])+ dfs(j)

if (temp.size> res.size)

res= temp

}

}

dp[i]= res

return res

}

var res= listOf<Int>()

for (iin nums.indices) {

val temp= dfs(i)

if (temp.size> res.size)

res= temp

}

return res

}

}