如何在Python中按长度和元素值对嵌套列表排序？

Hey there! Let's work through this sorting problem you're stuck on. The goal is to reorder a list of sublists where we first sort by the length of each sublist, then compare the sublists element-by-element—all without changing the order of elements inside the individual sublists themselves.

The Key Solution: Use a Tuple as the Sort Key #

In Python, both the sorted() function and the list.sort() method let you define a custom key to determine how elements are ranked. For your needs, a tuple is perfect here:

• The first value in the tuple is len(sublist)—this ensures we prioritize sorting by sublist length first.
• The second value is the sublist itself (sublist). Python natively compares lists lexicographically (element by element), which exactly matches your "逐项排序" requirement.

Example 1: Mixed Sublist Lengths #

Let's apply this to your first example:

list1 = [[0, 4, 1, 5], [3, 1, 5], [4, 0, 1, 5]]
sorted_list1 = sorted(list1, key=lambda x: (len(x), x))
print(sorted_list1)
# Output: [[3, 1, 5], [0, 4, 1, 5], [4, 0, 1, 5]]

Here's why this works:

1. The sublist [3,1,5] has length 3, so it moves to the front (since the other two have length 4).
2. For the two length-4 sublists, we compare element-by-element: 0 (first element of [0,4,1,5]) is less than 4 (first element of [4,0,1,5]), so the former comes first.

Example 2: Same-Length Sublists #

For your second example where all sublists share the same length:

list2 = [[4, 5, 2], [2, 5, 4], [2, 4, 5]]
sorted_list2 = sorted(list2, key=lambda x: (len(x), x))
print(sorted_list2)
# Output: [[2, 4, 5], [2, 5, 4], [4, 5, 2]]

Since all lengths are equal, we rely entirely on element-wise comparison:

• [2,4,5] leads because its first element (2) is smaller than 4 (from [4,5,2]).
• Between [2,4,5] and [2,5,4], the second element 4 is less than 5, so [2,4,5] takes the earlier spot.

In-Place Sorting (Modify the Original List) #

If you don't want to create a new list and prefer to sort the original in place, use the list.sort() method with the same key:

list1.sort(key=lambda x: (len(x), x))
print(list1)  # Original list is now sorted

Critical Note #

None of these methods modify the elements inside the sublists—we're only reordering their positions in the parent list, which is exactly what you asked for.

内容的提问来源于stack exchange，提问作者utij2004