小菜鸟的博客

【题目】Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the int

【题目】  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 fro

【题目】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 constan

【题目】Implement strStr().Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack.【题意】    实现strstr(). 返回needle(关键字)在haystack(字符串)中第一次出现的

题：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.题意：copy一个链表（深拷贝），链表包含一个next指

题：Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".题意：字符串反转（去除重复的空格）。分析：1，要求删除开头和结尾的多余空格。2，如果两个单词之间有多

题：Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's in that surrounded region.For example,X X X XX O O XX X O

题目：Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.OJ's undirected graph serialization:Nodes are labeled uniquely.We use # as a separator for

【题目】There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:Each child must have at

【题目】Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example, Given [0,1,0,2,1,0,1,3,2,1,

【题目】Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation of s1 = "great": great / \

【题目】Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"click to show corner cases.Corner Cases:

【题目】     Sort a linked list using insertion sort.【题意】     在链表中实现插入排序【分析】   传统数组版本做法就是两重循环，第一重是遍历所有元素，第二重是遍历已排序部分进行插入。对链表进行插入排序的正确方法是：新建一个头节点，遍历原来的链表，对原链表的每个节点找到新链表中适合插入位置的前指针，然后执行插入操作。

【题目】          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

【题目】                      Given a binary tree, return the preorder traversal of its nodes' values.           For example:          Given binary tree {1,#,2,3}, 1 \

【题目】Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first integer o

【题目】 Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If the target is not

【题目】 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: Recurs

【题目】 Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or ver

【题目】Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution.Example:Given nu

【题目】Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ]

【题目】  Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note: You may assume that nums1 has enough space (size that is greater or equal tom + n)

【题目】  Given an array and a value, remove all instances of that value in place and return the new length.  Do not allocate extra space for another array, you must do this in place with constant m

【题目】            Given inorder and postorder traversal of a tree, construct the binary tree.      Note:      You may assume that duplicates do not exist in the tree.【题意】    根据中序和后序遍历结果构

【题目】        Given preorder and inorder traversal of a tree, construct the binary tree.    Note:    You may assume that duplicates do not exist in the tree.【题意】  根据先序遍历和中序遍历创建二叉树即

【题目】     Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If found in the arra

【题目】Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the

【题目】Given an array S of n integers, are there elementsa, b, c in S such that a + b +c = 0? Find all unique triplets in the array which gives the sum of zero.Note: The solution set must not c

【题目】Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcode",dict = ["l

【题目】   Implement int sqrt(int x).Compute and return the square root of x.【题意】       实现x的平方根函数【分析】       二分搜索【实现】public class Solution { public int mySqrt(int x) { d

【题目】     Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.【题意】    归并k个有序列表【分析】【实现】

【题目】 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: Recu

【题目】       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.【题意】      链接两个有序表即对两个有序列表进行合并【分析

【题目】   Given a string s consists of upper/lower-case alphabets and empty space characters' ', return the length of last word in the string.If the last word does not exist, return 0.Note: A w

【题目】Given a collection of numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1]【题意】

【题目】Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest po

【题目】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 2

[题目]Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).For example:Given b

题目：Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may only be used once in the

【题目】        Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2] have the following unique permutations:[1,1,2], [1,2,