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 |
|
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 |
|
近期评论