LeetCode - Easy - 203. Remove Linked List Elements

Topic

• Linked List

Description

https://leetcode.com/problems/remove-linked-list-elements/

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

Analysis

方法一：三指针法。

方法二：递归法。

方法三：假链头法，比方法一精简些。

Submission

import com.lun.util.SinglyLinkedList.ListNode;

public class RemoveLinkedListElements {
	
	//方法一：三指针法
	public ListNode removeElements1(ListNode head, int val) {
		ListNode p0 = head, p1, p2;

		// 针对链头节点是val的情况
		while (p0 != null && p0.val == val) {
			p1 = p0.next;
			p0.next = null;// help GC
			p0 = p1;
		}

		if (p0 != null) {
			p1 = p0;
			p2 = p0.next;

			while (p2 != null) {
				if (p2.val == val) {
					p1.next = p2.next;
					p2.next = null;// help GC
					p2 = p1.next;
				} else {
					p1 = p2;
					p2 = p2.next;
				}
			}
		}

		return p0;
	}

	//方法二：递归法
	public ListNode removeElements2(ListNode head, int val) {
		if (head == null)
			return null;
		ListNode p1 = head;

		if (p1.val == val) {
			ListNode p2 = p1.next;
			p1.next = null;// help GC
			return removeElements2(p2, val);
		} else {
			p1.next = removeElements2(p1.next, val);
		}
		return p1;
	}

	//方法三：假头法，比方法一精简些
	public ListNode removeElements3(ListNode head, int val) {
		ListNode fakeHead = new ListNode(-1, head);
		ListNode p1 = fakeHead, p2 = fakeHead.next;

		while (p2 != null) {
			if (p2.val == val) {
				p1.next = p2.next;
				p2.next = null;// help GC
				p2 = p1.next;
			} else {
				p1 = p2;
				p2 = p2.next;
			}
		}

		p1 = fakeHead.next;
		fakeHead.next = null;// help GC
		return p1;
	}

}

Test

import static org.junit.Assert.*;
import org.junit.Test;

import com.lun.util.SinglyLinkedList;
import com.lun.util.SinglyLinkedList.ListNode;

public class RemoveLinkedListElementsTest {

	@Test
	public void test1() {
		RemoveLinkedListElements obj = new RemoveLinkedListElements();
		
		ListNode original1 = SinglyLinkedList.ints2List(1, 2, 6, 3, 4, 5, 6);
		ListNode expected1 = SinglyLinkedList.ints2List(1, 2, 3, 4, 5);
		assertTrue(SinglyLinkedList.areTwoListEqual(expected1, obj.removeElements1(original1, 6)));
		
		ListNode original2 = SinglyLinkedList.ints2List(6, 6, 6, 1, 2, 6, 3, 4, 5, 6);
		ListNode expected2 = SinglyLinkedList.ints2List(1, 2, 3, 4, 5);
		assertTrue(SinglyLinkedList.areTwoListEqual(expected2, obj.removeElements1(original2, 6)));
	}
	
	@Test
	public void test2() {
		RemoveLinkedListElements obj = new RemoveLinkedListElements();

		ListNode original1 = SinglyLinkedList.ints2List(1, 2, 6, 3, 4, 5, 6);
		ListNode expected1 = SinglyLinkedList.ints2List(1, 2, 3, 4, 5);
		assertTrue(SinglyLinkedList.areTwoListEqual(expected1, obj.removeElements2(original1, 6)));
		
		ListNode original2 = SinglyLinkedList.ints2List(6, 6, 6, 1, 2, 6, 3, 4, 5, 6);
		ListNode expected2 = SinglyLinkedList.ints2List(1, 2, 3, 4, 5);
		assertTrue(SinglyLinkedList.areTwoListEqual(expected2, obj.removeElements2(original2, 6)));
	}
	
	@Test
	public void test3() {
		RemoveLinkedListElements obj = new RemoveLinkedListElements();
		
		ListNode original1 = SinglyLinkedList.ints2List(1, 2, 6, 3, 4, 5, 6);
		ListNode expected1 = SinglyLinkedList.ints2List(1, 2, 3, 4, 5);
		assertTrue(SinglyLinkedList.areTwoListEqual(expected1, obj.removeElements3(original1, 6)));
		
		ListNode original2 = SinglyLinkedList.ints2List(6, 6, 6, 1, 2, 6, 3, 4, 5, 6);
		ListNode expected2 = SinglyLinkedList.ints2List(1, 2, 3, 4, 5);
		assertTrue(SinglyLinkedList.areTwoListEqual(expected2, obj.removeElements3(original2, 6)));
	}
}