[Leetcode] Delete Node in a Linked List

Well, this problem is just a trick. In fact, we cannot really delete the given node, but just delete it next node after copying the data of the Next node to it.

The code is as follows.

1 class Solution {2public:3     void deletenode (listnode* node) {4         listnode* next = node- next; 5         node, val = Next , Val; 6         Node-next = Next next ; 7     }8 };

If you is familiar with pointer operations, the code can be even shorter, just 1-line!

1 class Solution {2public:3     void deletenode (listnode* node) {4         *node = *node Next; 5     }6 };

This link shares solutions-problem in all supported languages of the Leetcode OJ. You are a look at it and appreciate the appetite for each language.

[Leetcode] Delete Node in a Linked List