LeetCode: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 ...
原文：[leetcode]Reorder List @ Python
原题地址：http: oj.leetcode.com problems reorder list 题意： Given a singly linked listL:L L Ln Ln,reorder it to:L Ln L Ln L Ln You must do this in place without altering the nodes values. For example,Given , ...
2014-04-30 10:59 0 2923 推荐指数：
相关推荐
[Leetcode] Reorder list 重排链表
Given a singly linked list L: L 0→L 1→…→L n-1→L n,reorder it to: L 0→L n →L 1→L n-1→L 2→L n-2→… You must do this in-place without altering the nodes ...
[LeetCode] 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 may not modify the values in the list's nodes, only ...
[leetcode]Sort List @ Python
原题地址：http://oj.leetcode.com/problems/sort-list/ 题意：链表的排序。要求：时间复杂度O(nlogn)，空间复杂度O(1)。 解题思路：由于题目对时间复杂度和空间复杂度要求比较高，所以查看了各种解法，最好的解法就是归并排序，由于链表在归并操作时 ...
[leetcode]Partition List @ Python
原题地址：https://oj.leetcode.com/problems/partition-list/ 题意： Given a linked list and a value x, partition it such that all nodes less than x come ...
[leetcode]Rotate List @ Python
原题地址：https://oj.leetcode.com/problems/rotate-list/ 题意： Given a list, rotate the list to the right by k places, where k is non-negative. ...
[leetcode]Linked List Cycle @ Python
原题地址：http://oj.leetcode.com/problems/linked-list-cycle/ 题意：判断链表中是否存在环路。 解题思路：快慢指针技巧，slow指针和fast指针开始同时指向头结点head，fast每次走两步，slow每次走一步。如果链表不存在环，那么fast ...