Python 代码不起作用！-- 将数组转换为 Zig-Zag 时尚

Question

Given an array arr of distinct elements of size N, the task is to rearrange the elements of the array in a zig-zag fashion so that the converted array should be in the below form: arr[0] < arr[1] > arr[2] < arr[3] > arr[4] <. . . . arr[n-2] < arr[n-1] > arr[n].

   def zigZag(self,arr, n):
        res=[]
        r=(n//2)+1
        arr.sort()
        j=0
        i=0
        for k in range(0, r, 1):
            res.insert(i, arr[j])
            res.insert(i+1, arr[j+r])
            i= i+2
            j+= j
        return res

Answer 1

You can sort the array and add to the new array from both sides of the array.

def zigZag(self, arr, n):
    res=[None]*n
    arr.sort()
    i = 0
    j = 0
    while i < n//2:
        res[j] = arr[i]
        res[j+1] = arr[n-1-i]
        i+=1
        j+=2 
    if n%2 == 1:
        res[-1] = arr[n//2]
    return res