목록2024/07/04 (1)

넘치게 채우기

[LeetCode] 2181. Merge Nodes in Between Zeros

https://leetcode.com/problems/merge-nodes-in-between-zeros/description/leetcode - Merge Nodes in Between Zeros문제 유형 : 연결리스트, 투 포인터문제 난이도 : Medium 문제You are given the head of a linked list, which contains a series of integers separated by 0's. The beginning and end of the linked list will have Node.val == 0.For every two consecutive 0's, merge all the nodes lying in between them into a single nod..
PS/LeetCode 2024. 7. 4. 16:50
이전 Prev 1 Next 다음