题目
地址
https://leetcode.com/problems/remove-duplicates-from-sorted-list/description/
内容
Given the head of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well.
Example 1:
Input: head = [1,1,2]
Output: [1,2]
Example 2:
Input: head = [1,1,2,3,3]
Output: [1,2,3]
Constraints:
- The number of nodes in the list is in the range [0, 300].
- -100 <= Node.val <= 100
- The list is guaranteed to be sorted in ascending order.
解题
这题要求从有重复数据的有序数组中剔除重复数据,并保持原来的顺序。因为有序,所以重复的数据是相邻的。这样我们就需要对比相邻的数据,如果它们相等,则剔除位置靠后的元素(靠next指针重新指向);如果不相等,则向后继续探索。
代码地址
https://github.com/f304646673/leetcode/tree/main/83-Remove-Duplicates-from-Sorted-List