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) {
if (head == null) {
return head;
}
ListNode start = head;
ListNode end = head.next;
while (end != null) {
if (start.val == end.val) {
end = end.next;
if (end == null) {
start.next = null;
}
} else {
start.next = end;
start = start.next;
end = end.next;
}
}
return head;
}
}
本文介绍了一种从已排序链表中删除所有重复元素的方法,确保每个元素仅出现一次。通过遍历链表并比较相邻节点值来实现,若发现重复则跳过重复节点,最终返回处理后的链表。
720

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



