[리트코드] 932. Beautiful Array

문제 Beautiful Array - LeetCode Can you solve this real interview question? Beautiful Array - An array nums of length n is beautiful if: * nums is a permutation of the integers in the range [1, n]. * For every 0 <= i < j < n, there is no index k with i < k < j where 2 * nums[k] == nums[i] + nums[j].

Given the integer n, return any... leetcode.com An array nums of length n is beautiful if: nums is a permutation of the integers in the range [1, n]. For every 0 <= i < j < n, there is no index k with ...