솜씨좋은장씨

Given a sorted linked list, delete all duplicates such that each element appear only once.

Example 1:

Input: 1->1->2
Output: 1->2

Example 2:

Input: 1->1->2->3->3
Output: 1->2->3

Solution

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def deleteDuplicates(self, head: ListNode) -> ListNode:
        list_values = []
        
        while head != None:
            list_values.append(head.val)
            
            head = head.next
            
        set_values = sorted(list(set(list_values)))
            
        answerList = ListNode(0) 
        
        result = answerList 
        
        for num in set_values: 
            answerList.next = ListNode(num) 
            answerList = answerList.next 
        return result.next