diff --git a/0206-reverse-linked-list/README.md b/0206-reverse-linked-list/README.md new file mode 100644 index 0000000..bb54087 --- /dev/null +++ b/0206-reverse-linked-list/README.md @@ -0,0 +1,32 @@ +
Given the head
of a singly linked list, reverse the list, and return the reversed list.
+
Example 1:
+ +Input: head = [1,2,3,4,5] +Output: [5,4,3,2,1] ++ +
Example 2:
+ +Input: head = [1,2] +Output: [2,1] ++ +
Example 3:
+ +Input: head = [] +Output: [] ++ +
+
Constraints:
+ +[0, 5000]
.-5000 <= Node.val <= 5000
+
Follow up: A linked list can be reversed either iteratively or recursively. Could you implement both?
+