[Programmers] Tuple

https://programmers.co.kr/learn/courses/30/lessons/64065 ref: https://hazung.tistory.com/103

Solution 1

1
import re
2

3
def solution(s):
4
    answer = []
5
    s = s.split('},{')
6
    s = [re.sub('[{}]', '', c) for c in s]
7
    s = [list(map(int, c.split(','))) for c in s]
8
    s = list(sorted(s, key = len))
9

10
    for i in range(len(s)):
11
        target = s[i][0]
12
        answer.append(target)
13
        for j in range(i, len(s)):
14
            del s[j][s[j].index(target)]
15
    return answer

My approach. I just implemented what came to mind, so it’s not efficient.

Solution 2

1
def solution(s):
2
    answer = []
3
    s = s[2:-2]
4
    s = s.split("},{")
5
    s.sort(key = len)
6
    for i in s:
7
        ii = i.split(',')
8
        for j in ii:
9
            if int(j) not in answer:
10
                answer.append(int(j))
11
    return answer

Removing the irregular characters at the front and back lets us use the split result directly.
No need to convert to numbers early — just work with strings and convert later.
Elements of s are processed shortest first. So simply taking elements from the first one onward and adding them to answer if they’re not already there satisfies the problem’s definition of “tuple.”

Solution 3

1
import re
2

3
def solution(s):
4
    answer = []
5
    a = s.split(',{')
6
    a.sort(key = len)
7
    for j in a:
8
        numbers = re.findall("\d+", j)
9
        for k in numbers:
10
            if int(k) not in answer:
11
                answer.append(int(k))
12
    return answer

Same algorithm as solution 2. The difference is using regex to build a list from each element of s. This regex finds one or more digits and adds each match to a list before returning it.