82. 删除排序链表中的重复元素 II

  1. /**
  2. * Definition for singly-linked list.
  3. * public class ListNode {
  4. * int val;
  5. * ListNode next;
  6. * ListNode() {}
  7. * ListNode(int val) { this.val = val; }
  8. * ListNode(int val, ListNode next) { this.val = val; this.next = next; }
  9. * }
  10. */
  11. class Solution {
  12. public ListNode deleteDuplicates(ListNode head) {
  13. if (head == null)
  14. return null;
  15. if (head.next == null)
  16. return head;
  17. ListNode dummyNode = new ListNode();
  18. dummyNode.next = head;
  19. ListNode p = head, q = head.next;
  20. ListNode node = dummyNode;
  21. while (q != null) {
  22. if (p.val != q.val) {
  23. node = node.next;
  24. p = p.next;
  25. q = q.next;
  26. } else {
  27. while (q != null && p.val == q.val)
  28. q = q.next;
  29. node.next = q;
  30. if (q == null || q.next == null)
  31. break;
  32. p = q;
  33. q = q.next;
  34. }
  35. }
  36. return dummyNode.next;
  37. }
  38. }