上一页 1 2 3 4 5 6 7 ··· 11 下一页
摘要: 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 璨璨要好好学习 阅读(163) 评论(0) 推荐(0) 编辑
摘要: 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 璨璨要好好学习 阅读(347) 评论(0) 推荐(0) 编辑
摘要: 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 璨璨要好好学习 阅读(120) 评论(0) 推荐(0) 编辑
摘要: 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 璨璨要好好学习 阅读(152) 评论(0) 推荐(0) 编辑
摘要: 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 璨璨要好好学习 阅读(160) 评论(0) 推荐(0) 编辑
摘要: 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 璨璨要好好学习 阅读(103) 评论(0) 推荐(0) 编辑
摘要: 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 璨璨要好好学习 阅读(124) 评论(0) 推荐(0) 编辑
摘要: 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 璨璨要好好学习 阅读(114) 评论(0) 推荐(0) 编辑
摘要: 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 璨璨要好好学习 阅读(1302) 评论(0) 推荐(0) 编辑
摘要: 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 璨璨要好好学习 阅读(164) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 ··· 11 下一页