shanshanhi的博客

Merge Two Sorted Lists Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 方法一、递归的方法ListNode* mergeTwoLis...

Reverse Linked List II Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given 1->2->3->4->5->NULL, m = 2 and n = 4, return 1->4->3->2->5->NULL. Note: Given

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}, reord

Sort List Sort a linked list in O(n log n) time using constant space complexity. 本题不想做了，参考链接：（主要采用merge的思想进行做题） http://www.cnblogs.com/ganganloveu/p/3763707.html http://www.cnblogs.com/bakari/p/40

Add Two Numbers II You are given two linked lists representing two non-negative numbers. The most significant digit comes first and each of their nodes contain a single digit. Add the two numbers and

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 c

Rotate List Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given 1->2->3->4->5->NULL and k = 2, return 4->5->1->2->3->NULL. 注意：将链表首尾相连的技巧 思路如下：将链表首尾

Remove Duplicates from Sorted List II Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example, Given 1->2->3->3->4

技巧：1.插入头节点的技巧，诸如：删除链表中重复节点的题，反转链表某个区间的题等，通过插入头节点，可以使得对头节点的操作同后面节点的操作一样；2.设置一快一慢指针，诸如：判断一个链表是否有环，有环环的入口点，链表的快速排序（通过求中间节点，然后merge，递归实现的快速排序）等

Reverse Linked ListListNode* reverseList(ListNode* head) { if(NULL == head || NULL == head->next) { return head; } ListNode* p1 = head; ListNode* p2

Linked List Cycle II Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Note: Do not modify the linked list. Follow up: Can you solve it without using e

Partition List Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes

Palindrome Linked List Given a singly linked list, determine if it is a palindrome. ollow up: Could you do it in O(n) time and O(1) space?//本题可以采用暴力解决测办法，这需要使用一个额外的栈，则时间空间复杂度均为O(n) //本处采用的思路为：首

Remove Linked List Elements Remove all elements from a linked list of integers that have value val. Example Given: 1 –> 2 –> 6 –> 3 –> 4 –> 5 –> 6, val = 6 Return: 1 –> 2 –> 3 –> 4 –> 5ListNode* re

Remove Duplicates from Sorted List Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1-

Remove Nth Node From End of List Given a linked list, remove the nth node from the end of list and return its head For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the

Linked List Cycle follow up: Can you solve it without using extra space?bool hasCycle(ListNode *head) { /* 加上这句就超时我也是醉了 if(NULL == head && NULL == head->next) {

Intersection of Two Linked Lists Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:A: a1 → a2

Add Two Numbers You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and ...

Odd Even Linked List Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.You shou

Convert Sorted List to Binary Search Tree Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.Subscribe to see which companies asked this qu...

Insertion Sort List Sort a linked list using insertion sort. 本题为单链表的插入排序，easyListNode* insertionSortList(ListNode* head) { //本题很简单，是链表的插入排序 if(NULL == head || NULL == head->next)

题目描述： 　　给定一个乱序的单链表的头节点，对该链表中的节点进行排序 　　 要求时间复杂度为O(nlgn），空间复杂度为O(1)　　 　　 　　分析： 　　由于题目要求时间复杂度我O(nlgn），因此选择排序和插入排序可以排除。 　　在排序算法中，时间复杂度为O(nlgn）的主要有：归并排序、快速排序、堆排序。 　　其中堆排序的空间复杂度为（n），也不符合要求，因此也可