728x90
반응형
[LeetCode - Daily Challenge] 368. Largest Divisible Subset

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given a set of distinct positive integers nums, return the largest subset answer such that every pair (answer[i], answer[j]) of elements in this subset satisfies: answer[i] % answer[j] == 0, or answer[j] % answer[i] == 0 If there are multiple solutions, return any of them. Example 1: Input: nums = [1,2,3] Output: [1,2] Explanation: [1,3] is also accepted. Exa..
Algorithm/LeetCode Daily Challenge 2021. 11. 16. 10:30
728x90
반응형
1