Jan 09-remove Linked List Elements; Linked List; Pointer operation;

Data structure: One-way linked list. Pointer manipulation, note null pointer and the operation of the linked table head pointer

Code:

/**
* 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 cur = head;
while (head! = null && Head.val = = val) {
head = Head.next;
cur = cur.next;
}

while (cur = null && cur.next! = null) {
if (Cur.next.val = = val) cur.next = Cur.next.next;
else cur = cur.next;
}
return head;
}
}

Jan 09-remove Linked List Elements; Linked List; Pointer operation;