Add C++ solutions for leetcode 237.

Author: yanglr

Diff for: cpp-leetcode/leetcode237-delete-node-in-a-linked-list_solution1.cpp

@@ -0,0 +1,45 @@
+#include<vector>
+#include<algorithm>
+#include<iostream>
+using namespace std;
+
+/**
+ * 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) {
+        node->val = node->next->val;   /* 将要删除的node记作toBeDel, 这一步的作用是将结点toBeDel的value更新为与它的下一个node相等的值 */
+        node->next = node->next->next; // 将结点toBeDel的下一个结点跳过(删掉)       
+    }
+};
+
+// Test
+int main()
+{
+    Solution sol;    // 5->2->3->8->6
+    ListNode* head = new ListNode(5);
+    head->next = new ListNode(2);
+    head->next->next = new ListNode(3);
+    head->next->next->next = new ListNode(8);
+    head->next->next->next->next = new ListNode(6);
+    head->next->next->next->next->next = nullptr;
+    
+    auto node = head->next->next; // 要删除的node的val为3
+    sol.deleteNode(node);
+
+    auto p = head;
+    while (p != nullptr)
+    {
+        cout << p->val << " ";        
+        p = p->next;
+    }
+
+    return 0;
+}

Diff for: cpp-leetcode/leetcode237-delete-node-in-a-linked-list_solution2.cpp

@@ -0,0 +1,44 @@
+#include<vector>
+#include<algorithm>
+#include<iostream>
+using namespace std;
+
+/**
+ * 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) {
+        *node = *(node->next); // 可以直接使用指针对结构体赋值
+    }
+};
+
+// Test
+int main()
+{
+    Solution sol;    // 5->2->3->8->6
+    ListNode* head = new ListNode(5);
+    head->next = new ListNode(2);
+    head->next->next = new ListNode(3);
+    head->next->next->next = new ListNode(8);
+    head->next->next->next->next = new ListNode(6);
+    head->next->next->next->next->next = nullptr;
+    
+    auto node = head->next->next; // 要删除的node的val为3
+    sol.deleteNode(node);
+
+    auto p = head;
+    while (p != nullptr)
+    {
+        cout << p->val << " ";        
+        p = p->next;
+    }
+
+    return 0;
+}