fork download
  1. import re
  2.  
  3. def mykey(s):
  4. lst = re.findall(r'(\d+)|(\D+)', s)
  5. return [(0,a.lower()) if a else (1,int(n)) for n, a in lst]\
  6. + [a for n, a in lst if a]\
  7. + [len(n) for n, a in lst if n]
  8.  
  9. test_cases = [
  10. # (unsorted list, sorted list)
  11. (list('bca'), ['a', 'b', 'c']),
  12. (list('CbA'), ['A', 'b', 'C']),
  13. (list('r0B9a'), ['a', 'B', 'r', '0', '9']),
  14. (['a2', '1a', '10a', 'a1', 'a100'], ['a1', 'a2', 'a100', '1a', '10a']),
  15. (['GAM', 'alp2', 'ALP11', '1', 'alp100', 'alp10', '100', 'alp1', '2'],
  16. ['alp1', 'alp2', 'alp10', 'ALP11', 'alp100', 'GAM', '1', '2', '100']),
  17. (list('ra0b9A'), ['A', 'a', 'b', 'r', '0', '9']),
  18. (['Abc', 'abc', 'ABc'], ['ABc', 'Abc', 'abc']),
  19. (['0A', '00a', 'a', 'A', 'A0', '00A', '0', 'a0', '00', '0a'],
  20. ['A', 'a', 'A0', 'a0', '0', '00', '0A', '00A', '0a', '00a'])
  21. ]
  22.  
  23. for case in test_cases:
  24. print(case[1])
  25. print(sorted(case[0], key=mykey))
  26.  
Runtime error #stdin #stdout 0.02s 5804KB
stdin
Standard input is empty
stdout
['a', 'b', 'c']
['a', 'b', 'c']
['A', 'b', 'C']
['A', 'b', 'C']
['a', 'B', 'r', '0', '9']
['a', 'B', 'r', '0', '9']
['a1', 'a2', 'a100', '1a', '10a']
['a1', 'a2', 'a100', '1a', '10a']
['alp1', 'alp2', 'alp10', 'ALP11', 'alp100', 'GAM', '1', '2', '100']
['alp1', 'alp2', 'alp10', 'ALP11', 'alp100', 'GAM', '1', '2', '100']
['A', 'a', 'b', 'r', '0', '9']
['A', 'a', 'b', 'r', '0', '9']
['ABc', 'Abc', 'abc']
['ABc', 'Abc', 'abc']
['A', 'a', 'A0', 'a0', '0', '00', '0A', '00A', '0a', '00a']