zshouyi的博客

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. Y

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.第一种方法，把linkedlist转化成arraylist，使用二分法构建BST。代码如下：/** * Definition for singly-linked lis

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.先遍历列表，得到列表长度。用k%len得到实际的step。如果step

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 in each of

Sort a linked list using insertion sort.linked list 的insertion sort，需要记住第一个node，以后的每一个curnode从第一个往后放到合适的位置。代码如下：/** * Definition for singly-linked list. * public class ListNode { * int va

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 should try to do it in

Sort a linked list in O(n log n) time using constant space complexity.这里采用merge sort。每次把linked list用slow和fast分成两段，再进行merge。代码如下：/** * Definition for singly-linked list. * public class ListNo

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of the list.这道题的意思是让完全拷贝一个链表。方法一：第一次遍历

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 extra space?这道题开

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->2->3.删除已经排序的list的重复val的node，保证

Remove all elements from a linked list of integers that have value val.ExampleGiven: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6,  val = 6Return: 1 --> 2 --> 3 --> 4 --> 5Credits:Special thank

Given a singly linked list, determine if it is a palindrome.Follow up:Could you do it in O(n) time and O(1) space?判断一个链表是不是构成回文。如果是数组时，我们会从中间开始向两边比较是不是相等。那么换作链表，只能单向访问，怎么办？可以从中间node开始，后半部分进行

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 ↘

Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?双指针问题，一个runner 和一个walker，runner 每次向后移动两个，walker 每次向后移动一个。当walker 等于runner 时，说明存在闭环

Reverse a singly linked list.click to show more hints.Hint:A linked list can be reversed either iteratively or recursively. Could you implement both?这道题可以看看这篇文章的指导：http://algorithms.tutori

Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with val

Design a Phone Directory which supports the following operations:get: Provide a number which is not assigned to anyone.check: Check if a number is available or not.release: Recycle or release