Delete_Node_in_a_Linked_List.cpp

/**
 * 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) {
          //Let the next node be the previous node, just change the value, do not need while loop
          ListNode* next_node = node->next;
          node->val = next_node->val;
          node->next = next_node->next;
          delete next_node;
    }
};