<qiyuangong>143_Reorder_List_1.py
def reorderList( head):
    if not head:
        return
    dmap = []
    current = head
    while current is not None:
        dmap.append(current)
        current = current.next
    ls = len(dmap)
    for i in range(ls / 2):
        t = -1 * (i + 1)
        dmap[t].next = dmap[i].next
        dmap[i].next = dmap[t]
    dmap[ls / 2].next = None
def sample_funcname ( var_0 ) :
    if not var_0 :
        return
    var_1 = [ ]
    var_2 = var_0
    while var_2 is not None :
        var_1.append ( var_2 )
        var_2 = var_2.next
    var_7 = len ( var_1 )
    for var_10 in range ( var_7 / 2 ) :
        var_12 = - 1 * ( var_10 + 1 )
        var_1 [ var_12 ].next = var_1 [ var_10 ].next
        var_1 [ var_10 ].next = var_1 [ var_12 ]
    var_1 [ var_7 / 2 ].next = None
