我有一个包含[name, surname, int1, int2]元素的数组,我需要按照以下顺序对其进行排序:
int1 (递减)。int1是相同的,按name按“反向”-alphabetical顺序排序。name相同,则surname按字母顺序排序。所以我有这个:
print(sorted(a, key = lambda x: [-int(x[2]), x[0], x[1]]))我不知道如何按字母顺序对x[0]进行排序,-x[0], x[0][::-1]对我不起作用。
示例:
[('Petia', 'Anja', 3, 0),
('Vasia', 'Katia', 3, 0),
('Petia', 'Katia', 3, 0),
('Kolia', 'Alexey', 10, 0),
('Yana', 'Anja', 10, 0)]至
[('Yana', 'Anja', 10, 0),
('Kolia', 'Alexey', 10, 0),
('Vasia', 'Katia', 3, 0),
('Petia', 'Anja', 3, 0),
('Petia', 'Katia', 3, 0)]发布于 2018-07-11 20:04:55
您可以为<创建一个具有实现的类(<是CPythons sorted所需的--如果您使用的是另一个sorted实现,则可能需要额外的比较操作符)。允许完全控制“订购”。例如:
class Sorter(object):
def __init__(self, tup):
self.name, self.surname, self.int1, self.int2 = tup
def __lt__(self, other):
# Just to make the logic clearer, in practise you could do nest the ifs
# to avoid computing self.int1 == other.int1 twice
if self.int1 == other.int1 and self.name == other.name:
return self.surname < other.surname
elif self.int1 == other.int1:
return self.name > other.name
else:
return self.int1 > other.int1然后将其用作key for sorted
>>> sorted(a, key=Sorter)
[('Yana', 'Anja', 10, 0),
('Kolia', 'Alexey', 10, 0),
('Vasia', 'Katia', 3, 0),
('Petia', 'Anja', 3, 0),
('Petia', 'Katia', 3, 0)]发布于 2018-07-11 21:28:45
>>> intab='abcdefghijklmnopqrstuvwxyz'
>>> tab = string.maketrans(intab+intab.upper(), intab[::-1]+intab.upper()[::-1])
>>>
>>> slst = sorted(lst, key = lambda x: [-int(x[2]), x[0].translate(tab), x[1]])
>>> pprint(slst)
[('Yana', 'Anja', 10, 0),
('Kolia', 'Alexey', 10, 0),
('Vasia', 'Katia', 3, 0),
('Petia', 'Anja', 3, 0),
('Petia', 'Katia', 3, 0)]
>>> https://stackoverflow.com/questions/51293341
复制相似问题