Problem:
Remove all elements from a linked list of integers that have value val.
Example:
Input: 1->2->6->3->4->5->6, val = 6 Output: 1->2->3->4->5
Analysis:
本题的思路是创建一个新的链表,对原来的链表所有元素一一进行匹配,如果发现相同的则不加入新的队列,反之则加入。代码如下:
Code:
/**
* 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) {
if(head == null)
return head;
ListNode p = head, pre = head;
ListNode res = new ListNode(-1);
ListNode ans = res;
while(p != null) {
if(p.val == val) {
p = p.next;
} else {
ListNode temp = new ListNode(p.val);
ans.next = temp;
ans = ans.next;
p = p.next;
}
}
return res.next;
}
}