剑指offer_10 删除链表中重复的结点

一、题目描述
Remove all elements from a linked list of integers that have value val.

Example:

Input: 1->2->6->3->4->5->6, val = 6
Output: 1->2->3->4->5
二、题解
递归

public ListNode removeElements(ListNode head, int val) {
	if(head == null)
		return head;
	head.next = removeElements(head.next, val);
	return head.val == val ? head.next : head;
}

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */

非递归实现：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    /**@Author: Tony
     * @Description：无虚拟头节点的情况
     * @Date: 2019/6/7 20:50
     * @Param：
     * @Return:
     */
    public ListNode removeElements(ListNode head, int val) {

        // 删除头节点  用while循环是因为删除头节点后  紧接着又要删除头节点的情况
        while (head != null && head.val == val){
//            ListNode delNode = head;
//            head = head.next;
//            delNode.next = null;
            head = head.next;
        }

        if(head == null){
            return null;
        }
        ListNode prev = head;
        // 使用循环可删除多个元素
        while (prev.next != null){
            if(prev.next.val == val){
//                ListNode delNode = prev.next;
//                prev.next = delNode.next;
//                delNode.next = null;
                prev.next = prev.next.next;
            }else{
                prev = prev.next;
            }
        }

        return head;
    }

    // 有虚拟头节点的情况
//    public ListNode removeElements(ListNode head, int val) {
//
//        ListNode dummyHead = new ListNode(-1);
//        dummyHead.next = head;
//
//        ListNode prev = dummyHead;
//        while(prev.next != null){
//            if(prev.next.val == val){
//                prev.next = prev.next.next;
//            }else {
//                prev = prev.next;
//            }
//        }
//        return dummyHead.next;
//    }
}

三、相似题目描述
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.

Example 1:

Input: 1->2->3->3->4->4->5
Output: 1->2->5
Example 2:

Input: 1->1->1->2->3
Output: 2->3
四、 代码实现

public ListNode deleteDuplicates(ListNode head) {
        if(head == null || head.next == null){
            return head;
        }

        ListNode dummyHead = new ListNode(0);
        dummyHead.next = head;

        ListNode prev = dummyHead;
        ListNode curr = head;
		while(curr != null && curr.next != null){
			if(curr.val == curr.next.val){
				while(curr.next != null && curr.val == curr.next.val){
					curr = curr.next;
				}
				curr = curr.next;
				prev.next = curr;
			}else{
				curr = curr.next;
				prev = prev.next;
			}
		}
		return dummyHead.next;
}

五、LeetCode 83. Remove Duplicates from Sorted List
1.题目
Given a sorted linked list, delete all duplicates such that each element appear only once.

2.代码实现

class Solution {
    public ListNode deleteDuplicates(ListNode head) {
        ListNode curr = head;
        while(curr != null && curr.next != null){
            if(curr.next.val == curr.val){
                curr.next = curr.next.next;
            }else{
                curr = curr.next;
            }
        }
        return head;
    }
}