최근 포스트

[LeetCode] 1528. Shuffle String

최대 1 분 소요

Python class Solution: def restoreString(self, s: str, indices: List[int]) -> str: answer = list(s) index = 0 for i in indices...

[LeetCode] 136. Single Number

최대 1 분 소요

Python class Solution: def singleNumber(self, nums: List[int]) -> int: counter = collections.Counter(nums) for i, v in counter.items()...

[Programmers] 행렬의 곱셈

최대 1 분 소요

Python def solution(arr1, arr2): answer = [] for i in range(len(arr1)): list = [] for j in range(len(arr2[0])): temp = 0 ...