Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 932 with 17 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 932 # by problem number
lcpy gen -s beautiful_array # by problem name
nums of length n is beautiful if:
nums is a permutation of the integers in the range [1, n].0 <= i < j < n, there is no index k with i < k < j where 2 * nums[k] == nums[i] + nums[j].n, return any beautiful array nums of length n. There will be at least one valid answer for the given n.
Input: n = 4
Output: [2,1,4,3]
Input: n = 5
Output: [3,1,2,5,4]
1 <= n <= 1000class Solution:
# Time: O(n)
# Space: O(n)
def beautiful_array(self, n: int) -> list[int]:
# Divide and conquer: odds and evens of a beautiful array are each
# beautiful, and concatenating two beautiful halves never creates a
# bad triple since 2 * nums[k] == nums[i] + nums[j] requires nums[i]
# and nums[j] of the same parity while k sits in the other half.
res = [1]
while len(res) < n:
res = [2 * x - 1 for x in res] + [2 * x for x in res]
return [x for x in res if x <= n]
| Time | Space |
|---|---|
| O(n) | O(n) |