From b7b7bd23dc998c5abb534ca07a6bda014294cf87 Mon Sep 17 00:00:00 2001
From: juan <juancloudcomputing@protonmail.com>
Date: Wed, 15 Jun 2022 22:32:23 +0800
Subject: [PATCH] vault backup: 2022-06-15 22:32:23

---
 .../pages/Leetcode Reverse-Linked-List.md     | 30 +++++++++++++++++--
 1 file changed, 27 insertions(+), 3 deletions(-)

diff --git a/CS notes/pages/Leetcode Reverse-Linked-List.md b/CS notes/pages/Leetcode Reverse-Linked-List.md
index 407f623..a5669d4 100644
--- a/CS notes/pages/Leetcode Reverse-Linked-List.md	
+++ b/CS notes/pages/Leetcode Reverse-Linked-List.md	
@@ -4,7 +4,7 @@
 
 ---
 ##### Algorithms:
-#algorithm #recursion 
+#algorithm #recursion #iteration 
 ##### Data structures:
 #DS #linked_list 
 ##### Difficulty:
@@ -17,15 +17,39 @@ tag:#linked_list
  
 
 ##### Links:
-- [Link to problem]()
+- [Link to problem](https://leetcode.com/problems/reverse-linked-list/)
 ___
 ### Problem
-
+Given the `head` of a singly linked list, reverse the list, and return _the reversed list_.
 #### Examples
+**Example 1:**
+
+![](https://assets.leetcode.com/uploads/2021/02/19/rev1ex1.jpg)
+
 ```markdown
+**Input:** head = [1,2,3,4,5]
+**Output:** [5,4,3,2,1]
+```
+
+**Example 2:**
+
+![](https://assets.leetcode.com/uploads/2021/02/19/rev1ex2.jpg)
+
+```markdown
+**Input:** head = [1,2]
+**Output:** [2,1]
+```
+
+**Example 3:**
+
+```markdown
+**Input:** head = []
+**Output:** []
 ```
 
 #### Constraints
+-   The number of nodes in the list is the range `[0, 5000]`.
+-   `-5000 <= Node.val <= 5000`
 
 ### Thoughts