题目描述:
反转一个单链表。
示例:
输入: 1->2->3->4->5->NULL 输出: 5->4->3->2->1->NULL
进阶:
你可以迭代或递归地反转链表。你能否用两种方法解决这道题?
解题思路:
第一步:
第二步:
代码实现(Java语言):
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
//递归方法解决
public ListNode reverseList2(ListNode head) {
if(head==null || head.next == null)
return head;
ListNode nextNode = head.next;
ListNode temp = reverseList(head.next);
nextNode.next = head;
head.next = null;
return temp;
}
//迭代方法解决
public ListNode reverseList(ListNode head) {
if(head==null || head.next == null)
return head;
ListNode nextNode = head.next;
ListNode cur = head;
head.next = null;
ListNode tempNext = null;
while(nextNode != null){
tempNext = nextNode.next;
nextNode.next = cur;
cur = nextNode;
nextNode = tempNext;
}
return cur;
}
}