Published:
Updated:

  • ํŒŒ์ด์ฌ TeamSort ๋‚ด์žฅ ํ•จ์ˆ˜(sort())๋ฅผ ์ด์šฉํ•˜์—ฌ ํ’‚
    • ์ž๋ฐ”์—์„œ๋„ Collections๋ฅผ ์ด์šฉํ•˜๋ฉด Teamsort ์‚ฌ์šฉ ๊ฐ€๋Šฅ


Solution

# Definition for singly-linked list.
from typing import Optional


class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next


class Solution:
    def sortList(self, head: Optional[ListNode]) -> Optional[ListNode]:
        arr = []
        linked_to = head
        while linked_to:
            arr.append(linked_to.val)
            linked_to = linked_to.next

        arr.sort()

        linked_from = head
        for x in arr:
            linked_from.val = x
            linked_from = linked_from.next

        return head


Reference

Leave a comment