## [leetCode] 876. Middle of the Linked List (Python) 본문

Programming/코딩 1일 1문제

### [leetCode] 876. Middle of the Linked List (Python)

솜씨좋은장씨 2021. 1. 18. 00:34
728x90
반응형

Given a non-empty, singly linked list with head node head, return a middle node of linked list.

If there are two middle nodes, return the second middle node.

Example 1:

Input: [1,2,3,4,5]
Output: Node 3 from this list (Serialization: [3,4,5])
The returned node has value 3.  (The judge's serialization of this node is [3,4,5]).
Note that we returned a ListNode object ans, such that:
ans.val = 3, ans.next.val = 4, ans.next.next.val = 5, and ans.next.next.next = NULL.

Example 2:

Input: [1,2,3,4,5,6]
Output: Node 4 from this list (Serialization: [4,5,6])
Since the list has two middle nodes with values 3 and 4, we return the second one.

Note:

• The number of nodes in the given list will be between 1 and 100.

Solution

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
def middleNode(self, head: ListNode) -> ListNode:
pre_node = post_node = head
while pre_node and pre_node.next:
pre_node = pre_node.next.next
post_node = post_node.next
return post_node

728x90
반응형

#### 'Programming > 코딩 1일 1문제' 카테고리의 다른 글

 [leetCode] 1451. Rearrange Words in a Sentence (Python)  (0) 2021.01.20 2021.01.19 2021.01.17 2021.01.16 2021.01.15