Given a sorted linked list, delete all duplicates such that each element appear onlyonce.
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) {
// Start typing your Java solution below
// DO NOT write main() function
if(head == null)
return head;
ListNode cur = head;
ListNode next;
while(cur != null && cur.next != null){
next = cur.next;
if(next.val == cur.val){
cur.next = next.next;
}
else{
cur = cur.next;
}
}
return head;
}
}
本文介绍了一种从已排序链表中删除所有重复元素的方法,确保每个元素仅出现一次。通过遍历链表并比较相邻节点的值来实现重复项的移除。
685

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



