Package g0901_1000.s0932_beautiful_array

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    932 - Beautiful Array.

    Medium

    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 beautiful array nums of length n. There will be at least one valid answer for the given n.

    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

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final IntArray beautifulArray(Integer n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait