删除链表中等于给定值 val 的所有节点。
示例:
输入: 1->2->6->3->4->5->6, val = 6 输出: 1->2->3->4->5
C++
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
ListNode* p = new ListNode(1) ;
p->next = head ;
ListNode* re ;
re = p ;
if(head ==NULL) return NULL ;
while(head)
{
if(head->val == val)
{
p ->next = head->next ;
ListNode* q ;
q = head ;
head = head->next ;
delete q;
q = NULL ;
}
else
{ p = p->next ;
head = head->next ;
}
}
return re->next;
}
};
JAVA :
/**
* 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 p = new ListNode(1) ; // 用一个节点来存放要检测的上一个节点
p.next = head ;
ListNode re = p;
if(head == null) return null ;
while(head !=null)
{
if(head.val==val)
{
p.next = head.next;
}
else
{
p = p.next;
}
head = head.next;
}
return re.next;
}
}