반응형
1209. Remove All Adjacent Duplicates in String II

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem You are given a string s and an integer k, a k duplicate removal consists of choosing k adjacent and equal letters from s and removing them, causing the left and the right side of the deleted substring to concatenate together. We repeatedly make k duplicate removals on s until we no longer can. Return the final string after all such duplicate removals have be..
Algorithm/LeetCode Daily Challenge 2022. 5. 19. 10:30
반응형
1