LeetCode 1836. Remove Duplicates From an Unsorted Linked List – 链表(Linked List)系列题15
Given the head of a linked list, find all the values that appear more than once in the list and delete the nodes that have any of those values.
Return the linked list after the deletions.
Example 1:
Input: head = [1,2,3,2]
Output: [1,3]
Explanation: 2 appears twice in the linked list, so all 2's should be deleted. After deleting all 2's, we are left with [1,3].
Example 2:
Input: head = [2,1,1,2]
Output: []
Explanation: 2 and 1 both appear twice. All the elements sh
LeetCode 1836. Remove Duplicates From an Unsorted Linked List – 链表(Linked List)系列题15最先出现在Python成神之路。
共有 0 条评论