leetcode-list
文章平均质量分 60
kainever
这个作者很懒,什么都没留下…
展开
-
leetcode - Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head. For example,Given 1->2->3->4, you should return the list as 2->1->4->3. Your algorithm should use only constant space. You may原创 2015-07-25 22:14:26 · 264 阅读 · 0 评论 -
Reverse Linked List(****)
题目: 翻转链表思路: 1. head一直指向头节点 2. p 则是从头到尾遍历链表public class Solution { public ListNode reverseList(ListNode head) { if(head == null) return head; // head一直指向头节点, 而p 则是从头到尾遍历链表原创 2015-08-13 21:23:50 · 361 阅读 · 0 评论 -
Reorder List(***)
题目: Given a singly linked list L: L0→L1→…→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes’ values.思路: 1. 一个遍历指针 ite, 从头遍历 2. 一个尾部指针 tail,总是指向当前的原创 2015-08-15 15:30:04 · 366 阅读 · 0 评论