Add C++ implementation

Signed-off-by: begeekmyfriend <[email protected]>

Author: begeekmyfriend

0206_reverse_linked_list/reverse_list.c

@@ -1,6 +1,7 @@
 #include <stdio.h>
 #include <stdlib.h>
 
+
 struct ListNode {
     int val;
     struct ListNode *next;
@@ -17,15 +18,15 @@ static struct ListNode *recursive(struct ListNode *prev, struct ListNode *p)
     return recursive(p, q);
 }
 
-static struct ListNode *reverseList(struct ListNode *head)
+struct ListNode *reverseList(struct ListNode *head)
 {
     return recursive(NULL, head);
 }
 
 
-/* Iteration */
 #if 0
-static struct ListNode *reverseList(struct ListNode *head)
+/* Iteration */
+struct ListNode *reverseList(struct ListNode *head)
 {
     struct ListNode *prev = NULL;
     struct ListNode *p = head;

0206_reverse_linked_list/reverse_list.cc

@@ -0,0 +1,28 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+/**
+ * Definition for singly-linked list.
+ * struct ListNode {
+ *     int val;
+ *     ListNode *next;
+ *     ListNode() : val(0), next(nullptr) {}
+ *     ListNode(int x) : val(x), next(nullptr) {}
+ *     ListNode(int x, ListNode *next) : val(x), next(next) {}
+ * };
+ */
+class Solution {
+public:
+    ListNode* reverseList(ListNode* head) {
+        ListNode *prev = nullptr;
+        ListNode *p = head;
+        while (p != nullptr) {
+            ListNode *q = p->next;
+            p->next = prev;
+            prev = p;
+            p = q;
+        }
+        return prev;
+    }
+};