[프로그래머스] 외벽 점검 (카카오, 구현, 순열)

https://programmers.co.kr/learn/courses/30/lessons/60062?language=python3

코딩테스트 연습 - 외벽 점검

 

from itertools import permutations
 
length = 0
 
 
def fix(weak, dist):
    index = 0
    size = len(weak)
 
    for d in dist:
        val = weak[index] + d
        for a in range(index, size):
            if weak[a] <= val:
                index = a + 1
            else:
                break
        if index == size:
            return True
 
    return False
 
 
def check(weak, dist):
    size = len(weak)
    for i in range(size):
        tmp = [weak[a] + length for a in range(i)]
        if fix(weak[i:] + tmp, dist):
            return True
    return False
 
 
def solution(n, weak, dist):
    global length
    length = n
    dist.sort(reverse=True)
 
    for i in range(1, len(dist) + 1):
        perms = permutations(dist, i)
        for perm in perms:
            if check(weak, perm):
                return i
 
    return -1

역시 카카오.. 구현 문제도 엄청나게 어렵게 낸다..

중요한 포인트는 순열을 이용하는 것.