LeetCode OJ - 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.

　　For example,
　　　　Given {1,2,3,4}, reorder it to {1,4,2,3}.

解题思路：

　　1、用快慢指针找到链表的中点，并将链表分割成两部分

　　2、翻转后面的部分

　　3、将前后两部分拼接

/*** Definition for singly-linked list.* struct ListNode {*     int val;*     ListNode *next;*     ListNode(int x) : val(x), next(NULL) {}* };*/
class Solution {
public:void reorderList(ListNode *head) {if (head == NULL) return;//find the last partListNode *mid = head, *last = head;while (last != NULL) {last = last->next;if (last == NULL) break;last = last->next;mid = mid->next;}ListNode *right_head = mid->next;mid->next = NULL;//翻转 右边部分ListNode *pre = NULL, *suf = right_head;while (suf != NULL) {ListNode * tmp = suf->next;if (tmp == NULL) {right_head = suf;}suf->next = pre;pre = suf;suf = tmp;}//拼接ListNode *cur = head;while (cur != NULL && right_head != NULL) {ListNode *tmp = right_head->next;right_head->next = cur->next;cur->next = right_head;right_head = tmp;cur = cur->next->next;}}
};

转载于:https://www.cnblogs.com/dongguangqing/p/3726345.html

LeetCode OJ - Reorder List相关推荐

LeetCode OJ -- Binary Tree Paths
http://blog.ubooksapp.com/ 标签(空格分隔): LeetCode OJ BinaryTree Given a binary tree, return all root-to- ...
【重点】LeetCode 143. Reorder List
LeetCode 143. Reorder List Solution1: 参考网址:http://www.cnblogs.com/grandyang/p/4254860.html 这段代码有值得学习 ...
[LeetCode] 143. Reorder List_Middle tag: Linked 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 mo ...
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 th ...
LeetCode OJ：Valid Anagram（有效字谜问题）
Given two strings s and t, write a function to determine if t is an anagram of s. For example, s = & ...
【LeetCode OJ 136】Single Number
题目链接:https://leetcode.com/problems/single-number/ 题目:Given an array of integers, every element appea ...
LeetCode OJ -Happy Number
题目链接:https://leetcode.com/problems/happy-number/ 题目理解:实现isHappy函数,判断一个正整数是否为happy数 happy数:计算要判断的数的每一 ...
leetcode day5 -- Reorder List Linked List Cycle II
1. Reorder List Given a singly linked list L: L0→L1→-→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln ...
[Leetcode][JAVA] 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 th ...

LeetCode OJ - Reorder List

LeetCode OJ - Reorder List相关推荐

最新文章

热门文章