206. Reverse Linked List [难度:简单] 【题目】 Reverse a singly linked list. Example: Input: 1->2->3->4->5->NULLOutput: 5->4->3->2->1->NULL Follow up: A linked list can be reversed either iteratively o
Reverse a singly linked list. Hint: A linked list can be reversed either iteratively or recursively. Could you implement both? 题目链接:https://leetcode.com/problems/reverse-linked-list/ 题目分析:链表的逆置