[연결리스트] 18 홀짝 연결 리스트(Odd Even Linked List)

<LeetCode 문제>

https://leetcode.com/problems/odd-even-linked-list/

Odd Even Linked List - LeetCode

<풀이>

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:
        if head is None:
            return None
        
        odd = head
        even = head.next
        even_head = head.next
        
        #반복하면서 홀짝 노드 처리
        while even and even.next:
            odd.next, even.next = odd.next.next,even.next.next
            odd, even = odd.next,even.next
        
        #홀수 노드의 마지막을 짝수 헤드로 연결
        odd.next = even_head
        return head

<학습내용>

1.

<학습이 필요한 내용>

1.