Reverse Linked List

Easy

Given the head of a singly linked list, reverse the list and return the new head. Lists are shown as arrays of node values.

Example 1

Input:  head = [1,2,3,4,5]
Output: [5,4,3,2,1]

Example 2

Input:  head = []
Output: []

Constraints

• 0 <= number of nodes <= 5000
• -5000 <= Node.val <= 5000