[완전탐색] 소수 찾기

1. 문제

2-1. 시간초과나는 나의 풀이

def solution(numbers):
    max = 10 ** len(numbers)
    primes = []

    for i in range(1, max):
        if i == 1:
            continue
        is_prime = True

        haha = str(i)
        haha += numbers
        if set(haha) != set(numbers):
            continue
        for j in range(2, i):
            if i % j == 0:
                is_prime = False
        if is_prime:
            temp = str(i)
            flag = True
            while temp:
                for n in numbers:
                    temp = temp.replace(n,'',1)
                if temp:
                    flag = False
                    temp = ''
                else:
                    temp = ''
            if flag:
                primes.append(i)
    return len(primes)

3-1. 남의 풀이

• https://train-validation-test.tistory.com/entry/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4%EC%BD%94%EB%94%A9%ED%85%8C%EC%8A%A4%ED%8A%B8-%EC%97%B0%EC%8A%B5-%EC%99%84%EC%A0%84%ED%83%90%EC%83%89-%EC%86%8C%EC%88%98-%EC%B0%BE%EA%B8%B0
  
  

3-2. 남의 풀이

• https://dev-jinee.tistory.com/7
  

4. 느낀 점

5. replace 함수의 옵션

• https://yuddomack.tistory.com/entry/%ED%8C%8C%EC%9D%B4%EC%8D%AC-replace-%EB%AC%B8%EC%9E%90%EC%97%B4-%EC%A0%9C%EA%B1%B0-%EC%88%98%EC%A0%95%EB%B3%80%ED%99%98