xiao1ni1zi的专栏

Sort a linked list in O(n log n) time using constant space complexity./** * Definition for singly-linked list. * class ListNode { * int val; * ListNode next; * ListNode(int x) { *

1. [1]. Reverse Words in a String：空格的处理2. Evaluate Reverse Polish Notation： 栈3. Single Number II 位运算4. Single Number 位运算5. Longest Common Prefix : 平常的字符串比较6. Regular Expression Matching : 递归

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.题目大衣

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.AC代码：

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is

1. Best Time to Buy and Sell Stock2. Best Time to Buy and Sell Stock II3. Pascal's Triangle4. Roman to Integer5. Integer to Roman6. LRU Cache7. Word Break II8. Word Break: 动态规划9. C

1. Palindrome Number2. Add Two Numbers3. Permutations4. Gray Code5. Sqrt(x)6. Plus One7. Valid Number8. Pow(x, n)9. Permutations II10. Divide Two Integers11. 4Sum12. 3Sum Close

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->4->5, return 1->2->5.Given 1->1-

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 second node from the end, the l

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.AC代码：

题型分类------链表一、链表排序1. Sort List: 对一个单链表排序，要求时间复杂度为O(nlogn);2. Insertion Sort List: 用插入法对单链表排序；3. Reorder List: 将一个链表进行交叉排序，比如给一个链表 L: L0→L1→…→Ln-1→Ln，要求排完序后为L0→Ln→L1→Ln-1→L2→Ln-2→

Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2].Note: Recursive solutio

Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3},1\2/3return [1,2,3].Note: Recursive solution is trivial, could you

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 binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [3,2,1].Note: Recursive solut

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree and sum

Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Follow up:Can you solve it without using extra space?分析：如图：

Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321

Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using ext

Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without usi

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

Two SumGiven an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the ta

Sort a linked list using insertion sort.AC代码：/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x;

Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?AC代码：

Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For example:Given binary tree {3,9,20,#,#,15,7},

Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.思路：z

Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the f

题型分类------树一、树的遍历1. Binary Tree Preorder Traversal: 使用递归和非递归 前序遍历，主要考察非递归；2. Binary Tree Inorder Traversal: 使用递归和非递归 中序遍历，主要考察非递归；3. Binary Tree Postorder Traversal: 使用递归和非递归 后序遍历，主要考察非递归；

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 m, n satisfy the

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20