728x90
반응형
[LeetCode - Daily Challenge] 565. Array Nesting

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem You are given an integer array nums of length n where nums is a permutation of the numbers in the range [0, n - 1]. You should build a set s[k] = {nums[k], nums[nums[k]], nums[nums[nums[k]]], ... } subjected to the following rule: The first element in s[k] starts with the selection of the element nums[k] of index = k. The next element in s[k] should be nums[n..
Algorithm/LeetCode Daily Challenge 2021. 9. 2. 15:52
728x90
반응형
1