An array nums of length n is beautiful if:
Given the integer n, return any beautiful array nums of length n. There will be at least one valid answer for the given n.
Examples
Example 1
Input: n = 4
Output: [2,1,4,3]
Example 2
Input: n = 5
Output: [3,1,2,5,4]
Constraints
1 <= n <= 1000
932. Beautiful Array
Medium
30 Points
Array
Math
Divide and Conquer
An array nums of length n is beautiful if:
Given the integer n, return any beautiful array nums of length n. There will be at least one valid answer for the given n.