java实现LeetCode中---203.移除链表元素

删除链表中等于给定值 val 的所有节点。

示例:

输入: 1->2->6->3->4->5->6, val = 6
输出: 1->2->3->4->5

先定义一个ListNode类

package com.learn.datastructure.linkedlist;

public class ListNode {
    int val;
    ListNode next;

    ListNode(int x) {
        val = x;
    }
}

然后写实现

package com.learn.datastructure.linkedlist;

/**
 * Definition for singly-linked list.
 * public class ListNode {
 * int val;
 * ListNode next;
 * ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode removeElements(ListNode head, int val) {
        //先判断头结点
        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;
    }
}

使用虚拟头结点的方式实现

package com.learn.datastructure.linkedlist;

/**
 * Definition for singly-linked list.
 * public class ListNode {
 * int val;
 * ListNode next;
 * ListNode(int x) { val = x; }
 * }
 */
//虚拟头结点实现方式
class Solution2 {
    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) {
                //删除的具体实现逻辑是注释掉的部分
                /*ListNode delNode = prev.next;
                prev.next = delNode.next;
                delNode.next = null;*/
                prev.next = prev.next.next;
            } else {
                prev = prev.next;
            }
        }

        return dummyHead.next;
    }
}

测试：在ListNode类中增加生成链表的方法

package com.learn.datastructure.linkedlist;

public class ListNode {
    int val;
    ListNode next;

    ListNode(int x) {
        val = x;
    }

    // 链表节点的构造函数
    // 使用arr为参数，创建一个链表，当前的ListNode为链表头结点
    public ListNode(int[] arr) {
        if (arr == null || arr.length == 0) {
            throw new IllegalArgumentException("arr can not be empty");
        }
        this.val = arr[0];
        ListNode cur = this;
        //将数组值添加到链表中
        for (int i = 1; i < arr.length; i++) {
            cur.next = new ListNode(arr[i]);
            cur = cur.next;
        }
    }

    // 以当前节点为头结点的链表信息字符串
    @Override
    public String toString() {
        StringBuilder res = new StringBuilder();
        ListNode cur = this;
        while (cur != null) {
            res.append(cur.val + "->");
            cur = cur.next;
        }
        res.append("NULL");
        return res.toString();
    }

}

然后在Solution类中添加测试方法

package com.learn.datastructure.linkedlist;

/**
 * Definition for singly-linked list.
 * public class ListNode {
 * int val;
 * ListNode next;
 * ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode removeElements(ListNode head, int val) {
        //先判断头结点
        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 static void main(String[] args) {
        int[] nums={1,2,6,3,4,5,6};
        ListNode head =new ListNode(nums);
        System.out.println(head);
        ListNode res =(new Solution()).removeElements(head, 6);
        System.out.println(res);
        /*ListNode res =(new Solution2()).removeElements(head, 6);
        System.out.println(res);*/
    }


}

递归实现：

package com.learn.datastructure.recursive;

import com.learn.datastructure.linkedlist.ListNode;
/**
 * Definition for singly-linked list.
 * public class ListNode {
 * int val;
 * ListNode next;
 * ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode removeElements(ListNode head, int val) {
        if (head == null) {
            return null;
        }
        /*ListNode res=removeElements(head.next, val);
        if (head.val==val){
            return res;
        }else{
            head.next=res;
            return head;
        }*/
        head.next = removeElements(head.next, val);
        return head.val == val ? head.next : head;
    }

    //测试方法
    public static void main(String[] args) {
        int[] nums = {1, 2, 6, 3, 4, 5, 6};
        ListNode head = new ListNode(nums);
        System.out.println(head);
        ListNode res = (new Solution()).removeElements(head, 6);
        System.out.println(res);
    }


}