Improve name handling
Considered reversed first and last name order for uniqueness Sort names with same words close to each other
This commit is contained in:
parent
019813cc30
commit
68a60ea873
|
@ -30,8 +30,14 @@ def unique_combined_list(input1, input2):
|
||||||
if name not in final_list:
|
if name not in final_list:
|
||||||
final_list.append(name)
|
final_list.append(name)
|
||||||
|
|
||||||
# Sort the list
|
# Flatten the list into individual words
|
||||||
sorted_list = sorted(final_list)
|
flattened_words = [word for name in combined_list for word in name.split()]
|
||||||
|
|
||||||
|
# Sort the list based on the criteria discussed above
|
||||||
|
sorted_list = sorted(
|
||||||
|
final_list,
|
||||||
|
key=lambda x: (flattened_words.index(x.split()[0]), combined_list.index(x)),
|
||||||
|
)
|
||||||
|
|
||||||
# Convert the list back to a comma-separated string
|
# Convert the list back to a comma-separated string
|
||||||
output = ",".join(sorted_list)
|
output = ",".join(sorted_list)
|
||||||
|
|
Loading…
Reference in New Issue