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;
* next = null;
* }
* }
*/
public class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head==null) return head;
ListNode cur = head;
while(cur.next != null) {
if(cur.val==cur.next.val) cur.next=cur.next.next;
else cur=cur.next;
}
return head;
}
}

本文介绍了一种从已排序链表中删除所有重复元素的方法,确保每个元素仅出现一次。通过一个简洁的Java实现示例,展示了如何遍历链表并移除重复项。
710

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



