Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,
Given 1->1->2, return 1->2.
Given 1->1->2->3->3, return 1->2->3.
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode deleteDuplicates(ListNode head) {
ListNode list = head;
while (list != null && list.next != null){
if (list.val == list.next.val){
list.next = list.next.next;
} else {
list = list.next;
}
}
return head;
}
}
本文介绍了一种从已排序链表中删除所有重复元素的方法,确保每个元素仅出现一次。通过一个简洁的示例代码展示了如何实现该功能。

242

被折叠的 条评论
为什么被折叠?



