solves reverse linked list

Author: anishLearnsToCode

README.md

@@ -64,7 +64,7 @@
 | 203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/RemoveLinkedListElements.java) |
 | 204 | [Count Primes](https://leetcode.com/problems/count-primes) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/CountPrimes.java) |
 | 205 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/IsomorphicStrings.java) |
-| 206 | [Reverse Linked Lists](https://leetcode.com/problems/reverse-linked-list) | Easy |
+| 206 | [Reverse Linked Lists](https://leetcode.com/problems/reverse-linked-list) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)]() |
 | 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | Easy |
 | 219 | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii) | Easy |
 | 225 | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues) | Easy |

src/ReverseLinkedList.java

@@ -0,0 +1,24 @@
+public class ReverseLinkedList {
+    private static class ListNode {
+        int val;
+        ListNode next;
+    }
+
+    public static ListNode reverseList(ListNode head) {
+        if (head == null || head.next == null) {
+            return head;
+        }
+
+        ListNode current = head, ahead = head.next, temp = head.next.next;
+        head.next = null;
+
+        while (temp != null) {
+            ahead.next = current;
+            current = ahead;
+            ahead = temp;
+            temp = temp.next;
+        }
+        ahead.next = current;
+        return ahead;
+    }
+}