fenshen371 - 博客园

2015年11月10日

摘要： Given a collection of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Each number ... 阅读全文

posted @ 2015-11-10 14:28 fenshen371 阅读(153) 评论(0) 推荐(0)

Subsets - LeetCode

摘要： Given a set of distinct integers,nums, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not... 阅读全文

posted @ 2015-11-10 14:16 fenshen371 阅读(177) 评论(0) 推荐(0)

Combination Sum - LeetCode

摘要： Given a set of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Thesamerepeated num... 阅读全文

posted @ 2015-11-10 14:11 fenshen371 阅读(148) 评论(0) 推荐(0)

Unique Binary Search Trees II - LeetCode

摘要： Givenn, generate all structurally uniqueBST's(binary search trees) that store values 1...n.For example,Givenn= 3, your program should return all 5 uni... 阅读全文

posted @ 2015-11-10 02:34 fenshen371 阅读(150) 评论(0) 推荐(0)

2015年11月9日

Find Median from Data Stream - LeetCode

摘要： Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two... 阅读全文

posted @ 2015-11-09 11:10 fenshen371 阅读(210) 评论(0) 推荐(0)

Kth Largest Element in an Array - LeetCode

摘要： Find thekth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For exampl... 阅读全文

posted @ 2015-11-09 10:43 fenshen371 阅读(139) 评论(0) 推荐(0)

Add and Search Word - Data structure design - LeetCode

摘要： Design a data structure that supports the following two operations:void addWord(word)bool search(word)search(word) can search a literal word or a regu... 阅读全文

posted @ 2015-11-09 08:04 fenshen371 阅读(165) 评论(0) 推荐(0)

Implement Trie (Prefix Tree) - LeetCode

摘要： Implement a trie withinsert,search, andstartsWithmethods.Note:You may assume that all inputs are consist of lowercase lettersa-z.思路：应该就是字典树。 1 class T... 阅读全文

posted @ 2015-11-09 07:39 fenshen371 阅读(144) 评论(0) 推荐(0)

2015年11月8日

Edit Distance - LeetCode

摘要： Given two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counted as 1 step.)You have the fol... 阅读全文

posted @ 2015-11-08 12:56 fenshen371 阅读(152) 评论(0) 推荐(0)

2015年11月4日

Wildcard Matching - LeetCode

摘要： Implement wildcard pattern matching with support for'?'and'*'.'?' Matches any single character.'*' Matches any sequence of characters (including the e... 阅读全文

posted @ 2015-11-04 15:37 fenshen371 阅读(133) 评论(0) 推荐(0)

Coder and Writer

一个ACMer的裸奔

公告