03 2017 档案

Merge Two Sorted Lists Leetcode
摘要：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. 思想和merge 阅读全文
posted @ 2017-03-26 06:25 璨璨要好好学习 阅读(168) 评论(0) 推荐(0)
Word Ladder Leetcode
摘要：Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWordto endWord, s 阅读全文
posted @ 2017-03-25 13:37 璨璨要好好学习 阅读(352) 评论(0) 推荐(0)
Word Break II Leetcode
摘要：Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each word is 阅读全文
posted @ 2017-03-24 02:49 璨璨要好好学习 阅读(127) 评论(0) 推荐(0)
Permutations II Leetcode
摘要：Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example,[1,1,2] have the following unique pe 阅读全文
posted @ 2017-03-22 05:05 璨璨要好好学习 阅读(158) 评论(0) 推荐(0)
Permutations Leetcode
摘要：Given a collection of distinct numbers, return all possible permutations. For example,[1,2,3] have the following permutations: [ [1,2,3], [1,3,2], [2, 阅读全文
posted @ 2017-03-18 05:09 璨璨要好好学习 阅读(165) 评论(0) 推荐(0)
Subsets II Leetcode
摘要：Given a collection of integers that might contain duplicates, nums, return all possible subsets. Note: The solution set must not contain duplicate sub 阅读全文
posted @ 2017-03-18 03:22 璨璨要好好学习 阅读(106) 评论(0) 推荐(0)
Combination Sum II Leetcode
摘要：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 num 阅读全文
posted @ 2017-03-17 12:25 璨璨要好好学习 阅读(132) 评论(0) 推荐(0)
Combination Sum Leetcode
摘要：Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums 阅读全文
posted @ 2017-03-17 11:35 璨璨要好好学习 阅读(122) 评论(0) 推荐(0)
Maximum Number in Mountain Sequence Lintcode
摘要：Given a mountain sequence of n integers which increase firstly and then decrease, find the mountain top. Given a mountain sequence of n integers which 阅读全文
posted @ 2017-03-17 05:01 璨璨要好好学习 阅读(1314) 评论(0) 推荐(0)
Palindrome Partitioning Leetcode
摘要：Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For exampl 阅读全文
posted @ 2017-03-16 03:45 璨璨要好好学习 阅读(168) 评论(0) 推荐(0)
Build Post Office II Lintcode
摘要：Given a 2D grid, each cell is either a wall 2, an house 1or empty 0 (the number zero, one, two), find a place to build a post office so that the sum o 阅读全文
posted @ 2017-03-06 05:38 璨璨要好好学习 阅读(900) 评论(0) 推荐(0)
Binary Tree Serialisation Lintcode
摘要：Design an algorithm and write code to serialize and deserialize a binary tree. Writing the tree to a file is called 'serialization' and reading back f 阅读全文
posted @ 2017-03-06 04:10 璨璨要好好学习 阅读(146) 评论(0) 推荐(0)
Zombie in Matrix Lintcode
摘要：Given a 2D grid, each cell is either a wall 2, a zombie 1or people 0 (the number zero, one, two).Zombies can turn the nearest people(up/down/left/righ 阅读全文
posted @ 2017-03-05 13:44 璨璨要好好学习 阅读(1059) 评论(0) 推荐(0)
Knight Shortest Path Lintcode
摘要：Given a knight in a chessboard (a binary matrix with 0 as empty and 1 as barrier) with a source position, find the shortest path to a destinationposit 阅读全文
posted @ 2017-03-05 12:57 璨璨要好好学习 阅读(480) 评论(0) 推荐(0)
Search Graph Nodes Lintcode
摘要：Given a undirected graph, a node and a target, return the nearest node to given node which value of it is target, return NULL if you can't find. There 阅读全文
posted @ 2017-03-05 07:12 璨璨要好好学习 阅读(826) 评论(0) 推荐(0)
Bomb Enemy Leetcode
摘要：Given a 2D grid, each cell is either a wall 'W', an enemy 'E' or empty '0' (the number zero), return the maximum enemies you can kill using one bomb.T 阅读全文
posted @ 2017-03-05 06:05 璨璨要好好学习 阅读(169) 评论(0) 推荐(0)
Word Break Leetcode
摘要：要注意因为数组长度是长一个的，所以最外层要有等号。 未完待续。。。 阅读全文
posted @ 2017-03-03 03:34 璨璨要好好学习 阅读(93) 评论(0) 推荐(0)
Alien Dictionary Leetcode
摘要：未完待续 阅读全文
posted @ 2017-03-03 03:33 璨璨要好好学习 阅读(140) 评论(0) 推荐(0)
Unique Paths Leetcode
摘要：A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any p 阅读全文
posted @ 2017-03-02 04:37 璨璨要好好学习 阅读(117) 评论(0) 推荐(0)
Minimum Path Sum Leetcode
摘要：Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. 阅读全文
posted @ 2017-03-01 09:31 璨璨要好好学习 阅读(113) 评论(0) 推荐(0)
Inorder Successor in BST Leetcode
摘要：Given a binary search tree and a node in it, find the in-order successor of that node in the BST. Note: If the given node has no in-order successor in 阅读全文
posted @ 2017-03-01 08:37 璨璨要好好学习 阅读(140) 评论(0) 推荐(0)