Beautiful Array
An array nums of length n is beautiful if:
numsis a permutation of the integers in the range[1, n].- For every
0 <= i < j < n, there is no indexkwithi < k < jwhere2 * nums[k] == nums[i] + nums[j].
Given the integer n, return any beautiful array nums of length n. There will be at least one valid answer for the given n.
Example 1
Input
n = 4Output
[2,1,4,3]The array is a permutation of [1, 4] and no middle element forms the average of two elements around it.
Example 2
Input
n = 5Output
[3,1,2,5,4]The array is a permutation of [1, 5] and satisfies the required no-average condition for every pair of positions.
Constraints
- 1 <= n <= 1000