hyunkookim 님의 블로그

82. Remove Duplicates from Sorted List II # Definition for singly-linked list.# class ListNode:# def __init__(self, val=0, next=None):# self.val = val# self.next = nextclass Solution: def deleteDuplicates(self, head: Optional[ListNode]) -> Optional[ListNode]: dummy = ListNode(0, head) left = dummy while left: if left.next and left.next.next ..

19. Remove Nth Node From End of List # Definition for singly-linked list.# class ListNode:# def __init__(self, val=0, next=None):# self.val = val# self.next = nextclass Solution: def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]: """ 아이디어는. 투 포인터(left, right)를 사용하고 right 포인터는 미리 n 만큼 먼저 shifting 한뒤. left, right 를..

25. Reverse Nodes in k-Group https://youtu.be/1UOPsfP85V4?si=VL2go-L_JkxKBX53 # Definition for singly-linked list.# class ListNode:# def __init__(self, val=0, next=None):# self.val = val # 노드의 값# self.next = next # 다음 노드를 가리키는 포인터class Solution: def reverseKGroup(self, head: Optional[ListNode], k: int) -> Optional[ListNode]: # 더미 노드 생성: head 이전에 추가해 리스트 시작점을 쉽게 다룰..