LeetCode 206 Reverse Linked List
Posted
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode 206 Reverse Linked List相关的知识,希望对你有一定的参考价值。
Reverse a singly linked list.
Solution 1 (recursion)
/** * Definition for singly-linked list. * public class ListNode { * public int val; * public ListNode next; * public ListNode(int x) { val = x; } * } */ public class Solution { public ListNode ReverseList(ListNode head) { if(head == null|| head.next ==null) { return head; } ListNode second = head.next; //set first‘s next to be null head.next = null; ListNode rest = ReverseList(second); second.next = head; return rest; } }
Solution 2 Iteration
public class Solution { public ListNode ReverseList(ListNode head) { if(head == null|| head.next ==null) { return head; } ListNode prev = null; while(head!=null) { ListNode temp = head.next; head.next = prev; prev= head; head = temp; } return prev; } }
以上是关于LeetCode 206 Reverse Linked List的主要内容,如果未能解决你的问题,请参考以下文章
Leetcode 206 Reverse Linked List 链表
LeetCode 206 Reverse Linked List
Leetcode 206: Reverse Linked List
[LeetCode]206. Reverse Linked List
206. Reverse Linked List(LeetCode)
Leetcode92. Reverse Linked List II && 206. Reverse Linked List