样例
给出链表 1->2->3->3->4->5->3 , 和 val = 3 , 你需要返回删除3之后的链表:1->2->4->5 。
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
/**
* @param head a ListNode
* @param val an integer
* @return a ListNode
*/
public ListNode removeElements(ListNode head, int val) {
// Write your code here
if(head == null){
return head;
}
ListNode cur = head;
ListNode nex = head.next;
while (nex != null){
if(nex.val == val){
cur.next = nex.next;
nex = nex.next;
}else{
cur = cur.next;
nex = nex.next;
}
}
if(head.val == val) head = head.next;
return head;
}
}
|