|
| 1 | +<h2><a href="https://leetcode.com/problems/reverse-linked-list">Reverse Linked List</a></h2> <img src='https://img.shields.io/badge/Difficulty-Easy-brightgreen' alt='Difficulty: Easy' /><hr><p>Given the <code>head</code> of a singly linked list, reverse the list, and return <em>the reversed list</em>.</p> |
| 2 | + |
| 3 | +<p> </p> |
| 4 | +<p><strong class="example">Example 1:</strong></p> |
| 5 | +<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/rev1ex1.jpg" style="width: 542px; height: 222px;" /> |
| 6 | +<pre> |
| 7 | +<strong>Input:</strong> head = [1,2,3,4,5] |
| 8 | +<strong>Output:</strong> [5,4,3,2,1] |
| 9 | +</pre> |
| 10 | + |
| 11 | +<p><strong class="example">Example 2:</strong></p> |
| 12 | +<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/rev1ex2.jpg" style="width: 182px; height: 222px;" /> |
| 13 | +<pre> |
| 14 | +<strong>Input:</strong> head = [1,2] |
| 15 | +<strong>Output:</strong> [2,1] |
| 16 | +</pre> |
| 17 | + |
| 18 | +<p><strong class="example">Example 3:</strong></p> |
| 19 | + |
| 20 | +<pre> |
| 21 | +<strong>Input:</strong> head = [] |
| 22 | +<strong>Output:</strong> [] |
| 23 | +</pre> |
| 24 | + |
| 25 | +<p> </p> |
| 26 | +<p><strong>Constraints:</strong></p> |
| 27 | + |
| 28 | +<ul> |
| 29 | + <li>The number of nodes in the list is the range <code>[0, 5000]</code>.</li> |
| 30 | + <li><code>-5000 <= Node.val <= 5000</code></li> |
| 31 | +</ul> |
| 32 | + |
| 33 | +<p> </p> |
| 34 | +<p><strong>Follow up:</strong> A linked list can be reversed either iteratively or recursively. Could you implement both?</p> |
0 commit comments