LeetCode – 203. Remove Linked List Elements

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

/** * Definition for singly-linked list. * public class ListNode { * int val; null){ if(pos.next !=null && pos.next.val == val){ pos.next = pos.next.next; } else{ pos = pos.next; } } return head; } }

This siteOriginal articleAll follow "Attribution-NonCommercial-ShareAlike 4.0 License (CC BY-NC-SA 4.0)Please retain the following annotations when sharing or adapting:

Original author:Jake Tao,source:「LeetCode – 203. Remove Linked List Elements」

128
0 0 128

Further Reading

Post a reply

Log inYou can only comment after that.
Share this page
Back to top