一种简单的解决方案是将每种类型“隔离”到它们自己的列表中，然后在追加时在它们之间交替：

list1 = [1,1,1]
sorted_list = []
sorted_list_indices = []

# Isolate each type to their own list of (index,item)
types = {
    'type0': [(ind,x) for ind,x in enumerate(list1) if x == 0],'type1': [(ind,x in enumerate(list1) if x == 1]
    }


# Alternate between the lists of each type,starting with the bigger list
alternator = 'type0' if len(types['type0']) > len(types['type1']) else 'type1'

for i in range(0,len(list1)):
    # Break if one of the lists is empty
    if len(types[alternator]) == 0: break
    # Pop the first item from the "current" list and append it to the output
    tup = types[alternator].pop(0)
    sorted_list_indices.append(tup[0])
    sorted_list.append(tup[1])
    # Switch to the other type
    alternator = 'type0' if alternator == 'type1' else 'type1'

print sorted_list
# [1,1]
print sorted_list_indices
# [0,2,4,3,5,6]

更新：这是另一个利用zip内置函数的示例：

list1 = [1,item)
type0 = [(ind,x in enumerate(list1) if x == 0]
# [(2,0),(4,(5,0)]
type1 = [(ind,x in enumerate(list1) if x == 1]
# [(0,1),(1,(3,(6,(7,1)]

big_list = type0 if len(type0) > len(type1) else type1
small_list = type0 if len(type0) <= len(type1) else type1

# Shrink the big list to make it larger by one at most
big_list = big_list[:len(small_list)+1]

# Use zip to get a list of tuples as (big_list,small_list)
zipped_list = zip(big_list,small_list)
# [((0,(2,0)),((1,((3,0))]

# If big_list is indeed larger,we append its last item to our zipped_list
if len(big_list) > len(small_list): zipped_list.append((big_list[-1],))
# [((0,((6,)]

# Flatten the zipped list of tuples
sorted_list = [tup[1] for zipped in zipped_list for tup in zipped]
sorted_list_indices = [tup[0] for zipped in zipped_list for tup in zipped]

print sorted_list
# [1,6]