Total Accepted: 66759
Total Submissions: 229425
Difficulty: Easy
Remove all elements from a linked list of integers that have value val.
Example
Given: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6
Return: 1 --> 2 --> 3 --> 4 --> 5
方法一:添加头结点
因为在此题中应该分为两种情况:如果头结点为val,那么应该将头结点删除;否则进行后面的判断。
如果在链表前面添加一个头结点,则只需要判断头结点后面的节点即可。
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode removeElements(ListNode head, int val) {
ListNode temp = new ListNode(0);
temp.next = head;
ListNode listnode = temp;
while(temp.next != null) {
if(temp.next.val == val) {
temp.next = temp.next.next;
} else {
temp = temp.next;
}
}
return listnode.next;
}
}
方法二:不添加头结点,既要判断head是否为null,又要判断head是否为val;
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode removeElements(ListNode head, int val) {
if(head == null) return null;
else{
ListNode temp = head;
while(temp.next != null) {
if(temp.next.val == val) {
temp.next = temp.next.next;
} else {
temp = temp.next;
}
}
return head.val == val?head.next:head;
}
}
}