목록Greedy (1)

Scribbling

LeetCode: 358. Rearrange String k Distance Apart

Greedy solution with heap & deque - append character with 'max frequency' currently - put the appended character to a deque for cool-down from collections import Counter, deque import heapq class Solution: def rearrangeString(self, s: str, k: int) -> str: if k = k: freq, char = q.popleft() if freq >= 1: heapq.heappush(h, (-freq, char)) return ''.join(ret) if len(ret) == len(s) else ""
Computer Science/Algorithms & Data Structures 2023. 3. 10. 23:01
이전 Prev 1 Next 다음