wxquare - 博客园

2016年12月13日

摘要： 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 阅读全文

posted @ 2016-12-13 20:49 wxquare 阅读(211) 评论(0) 推荐(0) 编辑

Add and Search Word

摘要： Trie 树的一个应用 Design a data structure that supports the following two operations: search(word) can search a literal word or a regular expression string 阅读全文

posted @ 2016-12-13 20:44 wxquare 阅读(404) 评论(0) 推荐(0) 编辑

Implement Trie (Prefix Tree)

摘要： Trie 树实现 Implement a trie with insert, search, and startsWith methods. 参看：http://www.cnblogs.com/grandyang/p/4491665.html 阅读全文

posted @ 2016-12-13 20:42 wxquare 阅读(172) 评论(0) 推荐(0) 编辑

2016年12月9日

Permutation Sequence

摘要： The set [1,2,3,…,n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order,We get the following sequence 阅读全文

posted @ 2016-12-09 16:05 wxquare 阅读(139) 评论(0) 推荐(0) 编辑

2016年11月27日

Reconstruct Itinerary

摘要： Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tick 阅读全文

posted @ 2016-11-27 11:02 wxquare 阅读(165) 评论(0) 推荐(0) 编辑

2016年11月26日

Course Schedule II

摘要： There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may have prerequisites, for example to take course 0 you have t 阅读全文

posted @ 2016-11-26 22:21 wxquare 阅读(231) 评论(0) 推荐(0) 编辑

Course Schedule

摘要： There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may have prerequisites, for example to take course 0 you have t 阅读全文

posted @ 2016-11-26 22:18 wxquare 阅读(253) 评论(0) 推荐(0) 编辑

2016年11月11日

Insert Interval

摘要：在已经排好序的区间中，插入一个新的区间，与merge的做法类似在已经排好序的区间中，插入一个新的区间，与merge的做法类似 Given a set of non-overlapping intervals, insert a new interval into the intervals (me 阅读全文

posted @ 2016-11-11 14:51 wxquare 阅读(160) 评论(0) 推荐(0) 编辑

Merge Intervals

摘要： Given a collection of intervals, merge all overlapping intervals. For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15,18]. 区间合并，分为三种情阅读全文

posted @ 2016-11-11 14:44 wxquare 阅读(181) 评论(0) 推荐(0) 编辑

Largest Number

摘要： Given a list of non negative integers, arrange them such that they form the largest number. For example, given [3, 30, 34, 5, 9], the largest formed n 阅读全文

posted @ 2016-11-11 10:52 wxquare 阅读(186) 评论(0) 推荐(0) 编辑

wxquare的学习笔记

公告