LeetCode Q237: Delete Node in a Linked List

Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.

Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3, the linked list should become 1 -> 2 -> 4 after calling your function.

	/**
	* Definition for singly-linked list.
	* struct ListNode {
	* int val;
	* ListNode *next;
	* ListNode(int x) : val(x), next(NULL) {}
	* };
	*/
	class Solution {
	public:
	void deleteNode(ListNode* node) {
	if(node==NULL)
	return;
	while(true){
	node->val = node->next->val;
	if(node->next->next==NULL){
	node->next=NULL;
	break;
	}
	node=node->next;
	}
	}
	};

view raw Q237DeleteNodeInALinkedList.cpp hosted with ❤ by GitHub

Round 2 solution:

	/**
	* Definition for singly-linked list.
	* struct ListNode {
	* int val;
	* ListNode *next;
	* ListNode(int x) : val(x), next(NULL) {}
	* };
	*/
	class Solution {
	public:
	void deleteNode(ListNode* node) {
	if(node==NULL)
	return;
	ListNode* p = node;
	ListNode* next=p->next;
	while(next->next!=NULL){
	p->val = next->val;
	p = next;
	next = p->next;
	}
	p->val = next->val;
	p->next = NULL;
	}
	};

view raw Q237Rnd2.cpp hosted with ❤ by GitHub