Surmountme
diff --git a/‎solutions/1-1000/206-reverse-linked-list.md‎
Lines changed: 125 additions & 5 deletions b/‎solutions/1-1000/206-reverse-linked-list.md‎
Lines changed: 125 additions & 5 deletions
@@ -9,12 +9,14 @@ Given the `head` of a singly linked list, reverse the list, and return _the reve
 
 ### [Example 1]
 ![](../../images/examples/206_1.jpg)
+
 **Input**: `head = [1,2,3,4,5]`
 
 **Output**: `[5,4,3,2,1]`
 
 ### [Example 2]
 ![](../../images/examples/206_2.jpg)
+
 **Input**: `[1,2]`
 
 **Output**: `[2,1]`
@@ -77,6 +79,15 @@ while (current != null) {
 
 ## Java
 ```java
+/**
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
 class Solution {
     public ListNode reverseList(ListNode head) {
         ListNode previous = null;
@@ -117,27 +128,136 @@ class Solution:
 
 ## C++
 ```cpp
-// Welcome to create a PR to complete the code of this language, thanks!
+/**
+ * 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* previous = nullptr;
+        ListNode* current = head;
+
+        while (current) {
+            auto temp_next = current->next;
+            current->next = previous;
+            previous = current;
+            current = temp_next;
+        }
+
+        return previous;
+    }
+};
 ```
 
 ## JavaScript
 ```javascript
-// Welcome to create a PR to complete the code of this language, thanks!
+/**
+ * function ListNode(val, next) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.next = (next===undefined ? null : next)
+ * }
+ */
+var reverseList = function (head) {
+  let previous = null
+  let current = head
+
+  while (current != null) {
+    const tempNext = current.next
+    current.next = previous
+    previous = current
+    current = tempNext
+  }
+
+  return previous
+};
 ```
 
 ## C#
 ```c#
-// Welcome to create a PR to complete the code of this language, thanks!
+/**
+ * public class ListNode {
+ *     public int val;
+ *     public ListNode next;
+ *     public ListNode(int val=0, ListNode next=null) {
+ *         this.val = val;
+ *         this.next = next;
+ *     }
+ * }
+ */
+public class Solution
+{
+    public ListNode ReverseList(ListNode head)
+    {
+        ListNode previous = null;
+        ListNode current = head;
+
+        while (current != null)
+        {
+            var tempNext = current.next;
+            current.next = previous;
+            previous = current;
+            current = tempNext;
+        }
+
+        return previous;
+    }
+}
 ```
 
 ## Go
 ```go
-// Welcome to create a PR to complete the code of this language, thanks!
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ *     Val int
+ *     Next *ListNode
+ * }
+ */
+func reverseList(head *ListNode) *ListNode {
+    var previous *ListNode
+    current := head
+
+    for current != nil {
+        tempNext := current.Next
+        current.Next = previous
+        previous = current
+        current = tempNext
+    }
+
+    return previous
+}
 ```
 
 ## Ruby
 ```ruby
-# Welcome to create a PR to complete the code of this language, thanks!
+# class ListNode
+#     attr_accessor :val, :next
+# 
+#     def initialize(val = 0, _next = nil)
+#         @val = val
+#         @next = _next
+#     end
+# end
+
+def reverse_list(head)
+  previous = nil
+  current = head
+
+  while current
+    temp_next = current.next
+    current.next = previous
+    previous = current
+    current = temp_next
+  end
+
+  previous
+end
 ```
 
 ## C