Softeer 연습문제(2단계) - 전광판

Candidate | Softeer Assessment UI

Candidate | Softeer Assessment UI

 

나의 코드

import sys

def _main(num1, num2, max_len):
    answer = 0
    number_dict = {'0': [1,1,1,0,1,1,1],
                   '1': [0,1,0,0,1,0,0], '2':[1,1,0,1,0,1,1], '3':[1,1,0,1,1,0,1], '4':[0,1,1,1,1,0,0],
                   '5': [1,0,1,1,1,0,1], '6':[1,0,1,1,1,1,1], '7':[1,1,1,0,1,0,0], '8':[1,1,1,1,1,1,1],
                   '9': [1,1,1,1,1,0,1], '*':[0,0,0,0,0,0,0]}
    for idx in range(max_len):
        for j in range(7):
            if (number_dict[num1[idx]][j] != number_dict[num2[idx]][j]):
                answer += 1
    return answer
    
ct = int(sys.stdin.readline())
for _ in range(ct):
    num1, num2 = sys.stdin.readline().rstrip().split()
    max_len = max(len(num1), len(num2))
    num1, num2 = '*' * (max_len - len(num1)) + num1, '*' * (max_len - len(num2)) + num2
    print(_main(num1, num2, max_len))

 

시간 복잡도

for idx in range(max_len) : max_len 길이 만큼 순회하며 비교 ( 선형 시간 )
해당 알고리즘 시간 복잡도 : 선형 시간 복잡도 ( O(n) )