notes/CS notes/pages/Leetcode Reverse-Linked-List.md
2022-06-15 22:32:23 +08:00

1 KiB

Leetcode Reverse-Linked-List

2022-06-15 22:07


Algorithms:

#algorithm #recursion #iteration

Data structures:

#DS #linked_list

Difficulty:

#leetcode #coding_problem #difficulty-easy

tag:#linked_list

Problem

Given the head of a singly linked list, reverse the list, and return the reversed list.

Examples

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

  • The number of nodes in the list is the range [0, 5000].
  • -5000 <= Node.val <= 5000

Thoughts

[!summary] This is a #template_remove_me

Solution