forked from andavid/leetcode-java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path203.remove-linked-list-elements.java
More file actions
52 lines (51 loc) · 1.03 KB
/
Copy path203.remove-linked-list-elements.java
File metadata and controls
52 lines (51 loc) · 1.03 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
/*
* @lc app=leetcode id=203 lang=java
*
* [203] Remove Linked List Elements
*
* https://leetcode.com/problems/remove-linked-list-elements/description/
*
* algorithms
* Easy (36.31%)
* Likes: 958
* Dislikes: 59
* Total Accepted: 250K
* Total Submissions: 686K
* Testcase Example: '[1,2,6,3,4,5,6]\n6'
*
* 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
*
*
*/
/**
* 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 dummy = new ListNode(0);
dummy.next = head;
ListNode prev = dummy;
ListNode curr = head;
while (curr != null) {
if (curr.val == val) {
prev.next = curr.next;
curr = curr.next;
} else {
prev = curr;
curr = curr.next;
}
}
return dummy.next;
}
}