迭代
/**
* Definition for singly-linked list.
* function ListNode(val, next) {
* this.val = (val===undefined ? 0 : val)
* this.next = (next===undefined ? null : next)
* }
*/
/**
* @param {ListNode} head
* @param {number} val
* @return {ListNode}
*/
var removeElements = function (head, val) {
var dummy = {
next: null
}
for (var cur = dummy; head != null; head = head.next) {
if (head.val == val) {
cur.next = head.next
continue
}
cur.next = head
cur = cur.next
}
return dummy.next
};
递归
var removeElements = function (head, val) {
if(head == null){
return head
}
head.next = removeElements(head.next,val)
return head.val == val ? head.next : head
};