https://leetcode.com/problems/odd-even-linked-list/description/
Odd Even Linked List - LeetCode
Odd Even Linked List - Given the head of a singly linked list, group all the nodes with odd indices together followed by the nodes with even indices, and return the reordered list. The first node is considered odd, and the second node is even, and so on. N
leetcode.com
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
|
# 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
|
cs |
반응형
'python-algorithm' 카테고리의 다른 글
| 백준 9773 ID Key (0) | 2023.02.21 |
|---|---|
| leetcode 92. Reverse Linked List II (0) | 2023.02.17 |
| leetcode 24. Swap Nodes in Pairs (0) | 2023.02.17 |
| leetcode 2. Add Two Numbers (0) | 2023.02.17 |
| leetcode 206. Reverse Linked List (0) | 2023.02.17 |
댓글