Question
Solution
题目大意:对一个链表进行反转
思路:
Java实现:
public ListNode reverseList(ListNode head) { ListNode newHead = null; while (head != null) { ListNode tmp = head.next; head.next = newHead; newHead = head; head = tmp; } return newHead;}
本文共 317 字,大约阅读时间需要 1 分钟。
题目大意:对一个链表进行反转
思路:
Java实现:
public ListNode reverseList(ListNode head) { ListNode newHead = null; while (head != null) { ListNode tmp = head.next; head.next = newHead; newHead = head; head = tmp; } return newHead;}
转载于:https://my.oschina.net/yysue/blog/1857585