Farthest Seat Assignment

Design the assignment behavior for a row of n</c

Constraints

When no seats are occupied yet, assign seat 0.

Example 1

Input:

n = 10
count = 5

Output:

[0,9,4,2,6]

Explanation: The first two assignments take the ends. The third assignment chooses seat 4, which is one of the middle seats farthest from 0 and 9; ties use the smaller index.

Example 2

Input:

n = 3
count = 4

Output:

[0,2,1]

Explanation: Only three seats exist, so only three assignments are returned.