难度:简单
删除链表中等于给定值 val 的所有节点。
示例:
输入: 1->2->6->3->4->5->6, val = 6 输出: 1->2->3->4->5
分析:
呃,找到它,删了它
代码:
/**
* 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) {
ListNode newHead = new ListNode(0);
newHead.next = head;
ListNode cur = head,pre = newHead;
while (cur != null){
if(cur.val == val){
pre.next = cur.next;
}else {
pre = cur;
}
cur = cur.next;
}
return newHead.next;
}
}
结果: