<doocs>0324.Wiggle Sort II_1.py
def wiggleSort( nums: List[int]) -> None:
    arr = sorted(nums)
    n = len(arr)
    i, j = (n - 1) >> 1, n - 1
    for k in range(n):
        if k % 2 == 0:
            nums[k] = arr[i]
            i -= 1
        else:
            nums[k] = arr[j]
            j -= 1
def sample_funcname ( var_0 : List [ int ] ) -> None :
    var_5 = sorted ( var_0 )
    var_7 = len ( var_5 )
    var_9 , var_10 = ( var_7 - 1 ) >> 1 , var_7 - 1
    for var_12 in range ( var_7 ) :
        if var_12 % 2 == 0 :
            var_0 [ var_12 ] = var_5 [ var_9 ]
            var_9 -= 1
        else :
            var_0 [ var_12 ] = var_5 [ var_10 ]
            var_10 -= 1
