ComDoc ComDoc

https://school.programmers.co.kr/learn/courses/30/lessons/60060 BF로 확인.. def solution(words, queries): import re answer = [0] * len(queries) for index, query in enumerate(queries): q = re.compile(f"^{query}$".replace("?", ".")) for word in words: if q.search(word) is not None: answer[index] += 1 return answer 당연히.. 정확성 테스트 테스트 1 〉통과 (1.79ms, 10.3MB) 테스트 2 〉통과 (1.12ms, 10.2MB) 테스트 3 〉통과 (1.21ms, ..

https://school.programmers.co.kr/learn/courses/30/lessons/49995 def solution(cookie): def total(a, b): return totals[b] - totals[a] totals = [0] for index, each in enumerate(cookie): totals.append(totals[index] + each) answers = set() total_max = sum(cookie) / 2 for mid in range(1, len(cookie)): first_total_set = set() for first in range(mid, - 1, -1): first_total = total(first, mid) if first_to..

https://school.programmers.co.kr/learn/courses/30/lessons/17685 class Node: def __init__(self): self.count = 0 self.children = {} class Trie: def __init__(self): self.root = Node() def insert(self, word): current = self.root for letter in word: if letter not in current.children: current.children[letter] = Node() current = current.children[letter] current.count += 1 def search(self, word): curren..

https://school.programmers.co.kr/learn/courses/30/lessons/140107 def solution(k, d): answer, d_square = 0, d ** 2 for i in range(0, d + 1, k): answer += int((d_square - i ** 2) ** .5) // k + 1 return answer 테스트 1 〉통과 (0.01ms, 10.1MB) 테스트 2 〉통과 (0.02ms, 10.1MB) 테스트 3 〉통과 (1.58ms, 10.3MB) 테스트 4 〉통과 (0.82ms, 10.2MB) 테스트 5 〉통과 (2.39ms, 10.1MB) 테스트 6 〉통과 (2.09ms, 10.5MB) 테스트 7 〉통과 (1.03ms, 10.1MB) 테스..

https://school.programmers.co.kr/learn/courses/30/lessons/140108 파이썬 def solution(s): first = s[0] new_index = slices = same = no_same = 0 for index, each in enumerate(s): new_index += 1 if each == first: same += 1 else: no_same += 1 if same == no_same: slices += 1 new_index = same = no_same = 0 if index + 1 < len(s): first = s[index + 1] return slices + (1 if new_index else 0) def solution(s): ..

파이썬 TTS를 검색하면 gTTS가 가장 많이 검색됩니다. 구글의 API를 이용해서 mp3로 받아오는 건데.... 꽤 불편합니다. 윈도우에도 TTS기능이 내장되어 있는데요. 오프라인에서 작동하고, 음질도 나쁘지 않습니다. https://learn.microsoft.com/en-us/previous-versions/windows/desktop/ms723627(v=vs.85) Microsoft Speech API (SAPI) 5.3 Table of contents Microsoft Speech API (SAPI) 5.3 Article 04/17/2012 2 minutes to read In this article --> Microsoft Speech API 5.3 Microsoft Speech API (SA..

https://school.programmers.co.kr/learn/courses/30/lessons/136797 간단히 완전 탐색. 당연히 시간 제한. 문제는 제대로 이해한 것 같고.. def solution(numbers): def search(left, right, index, total): if len(numbers) == index: return total if left == right: return float('inf') number = int(numbers[index]) left_total = search(number, right, index + 1, total) + weights[left][number] right_total = search(left, number, index + 1, t..

https://school.programmers.co.kr/learn/courses/30/lessons/92345 파이썬 def solution(board, aloc, bloc): def search(ay, ax, by, bx): next_nodes = [(ny, nx) for dy, dx in ((1, 0), (-1, 0), (0, 1), (0, -1)) if 0