Description
Given a sorted linked list, delete all duplicates such that each element appear only once.
Example 1:
1 | Input: 1->1->2 |
Example 2:
1 | Input: 1->1->2->3->3 |
解法
基本的链表操作,双指针法,注意空表的处理。
具体代码如下:
1 | class Solution { |
Thinking outside the box
Given a sorted linked list, delete all duplicates such that each element appear only once.
Example 1:
1 | Input: 1->1->2 |
Example 2:
1 | Input: 1->1->2->3->3 |
基本的链表操作,双指针法,注意空表的处理。
具体代码如下:
1 | class Solution { |