leetcode:(203) remove linked list elements(java)

package LeetCode_LinkedList;

/**
 * 题目：
 *      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
 * 解题思路：
 *      使用递归，若当前节点的值和val相等，返回当前节点的下一个节点；若不相等，返回当前节点。
 */
public class RemoveElements_203_1015 {
    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;
    }

    public static void main(String[] args) {
        ListNode node1 = new ListNode(1);
        ListNode node2 = new ListNode(2);
        ListNode node3 = new ListNode(3);
        ListNode node4 = new ListNode(4);
        ListNode node5 = new ListNode(5);

        node1.next = node2;
        node2.next = node3;
        node3.next = node4;
        node4.next = node5;

        RemoveElements_203_1015 test = new RemoveElements_203_1015();
        ListNode result = test.RemoveElements(node1, 1);

        while (result != null) {
            System.out.print(result.val + " ");
            result = result.next;
        }
    }
}