203.[LeetCode]Remove Linked List Elements

我的思路很简单，就是 重新创建一个链表

不过看起来效率并不是很高，可能单纯的循环或者递归会更快一些

public class Solution {    public ListNode removeElements(ListNode head, int val) {        if(head == null) return null;        ListNode currentNode = head;        ListNode newHead = new ListNode(0);        ListNode newNode;        ListNode curNew = newHead;        while(currentNode != null){            if(currentNode.val != val){                newNode = new ListNode(currentNode.val);                curNew.next = newNode;                curNew = curNew.next;            }            currentNode = currentNode.next;        }        return newHead.next;    }}