-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathProgrammers_Lv2_29.py
More file actions
32 lines (25 loc) · 1001 Bytes
/
Programmers_Lv2_29.py
File metadata and controls
32 lines (25 loc) · 1001 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
# def solution(files):
# answer = []
# for item in files:
# head, number, tail = '', '', ''
# num_check = False
# for i in range(len(item)):
# if item[i].isdigit():
# number += item[i]
# num_check = True
# elif not num_check:
# head += item[i]
# else:
# tail = item[i:]
# break
# answer.append([head, number, tail])
# result = sorted(answer, key = lambda x: (x[0].upper(), int(x[1])))
# return [''.join(item) for item in result]
import re
def solution(files):
answer = []
order_digit = sorted(files, key = lambda file : int(re.findall('\d{1,5}', file)[0]))
answer = sorted(order_digit, key = lambda file : re.findall('\D+', file)[0].upper())
# answer = sorted(order_digit, key = lambda file : re.split('\d{1,5}', file)[0].upper())
# 이것도 가능하다.
return answer