/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode deleteDuplicates(ListNode head) {
//使用虚拟节点,统一删除操作
ListNode dummy = new ListNode(0);
dummy.next = head;
ListNode p = dummy.next;
while(p!=null && p.next != null){
if(p.val == p.next.val){
p.next = p.next.next;
}else{
p = p.next;
}
}
return dummy.next;
}
}
推荐
class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head == null){
return head;
}
//使用虚拟节点,统一删除操作
ListNode dummy = new ListNode(0);
dummy.next = head;
ListNode p = dummy.next;
//p.next != null一个条件就行,因为模拟这个条件的最后一个情况就已经符合题意
while(p.next != null){
if(p.val == p.next.val){
p.next = p.next.next;
}else{
p = p.next;
}
}
return dummy.next;
}
}