Boostable

  博客园  :: 首页  :: 新随笔  :: 联系 :: 订阅 订阅  :: 管理

09 2014 档案

摘要:PAT 1087 All Roads Lead to Rome题目:Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the rout... 阅读全文
posted @ 2014-09-07 10:38 Boostable 阅读(825) 评论(0) 推荐(1)

摘要:PAT 1086 Tree Traversals Again题目:An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that wh... 阅读全文
posted @ 2014-09-07 10:24 Boostable 阅读(1017) 评论(0) 推荐(0)

摘要:PAT 1085 Perfect Sequence 题目:Given a sequence of positive integers and another positive integer p. The sequence is said to be a "perfect sequence" if ... 阅读全文
posted @ 2014-09-07 10:11 Boostable 阅读(216) 评论(0) 推荐(0)

摘要:PAT 1084 Broken Keyboard题目:On a broken keyboard, some of the keys are worn out. So when you type some sentences, the characters corresponding to those... 阅读全文
posted @ 2014-09-07 09:56 Boostable 阅读(608) 评论(0) 推荐(0)

摘要:LeetCode: Sort ColorsGiven an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colo... 阅读全文
posted @ 2014-09-04 21:56 Boostable 阅读(181) 评论(0) 推荐(0)

摘要:LeetCode: Minimum Window SubstringGiven a string S and a string T, find the minimum window in S which will contain all the characters in T in complexi... 阅读全文
posted @ 2014-09-04 21:23 Boostable 阅读(338) 评论(0) 推荐(0)

摘要:LeetCode: CombinationsGiven two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example,If n = 4 and k = 2, a solu... 阅读全文
posted @ 2014-09-04 20:59 Boostable 阅读(221) 评论(0) 推荐(0)

摘要:LeetCode: Word SearchGiven a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacen... 阅读全文
posted @ 2014-09-04 20:48 Boostable 阅读(331) 评论(0) 推荐(0)

摘要:LeetCode: Remove Duplicates from Sorted ArrayGiven a sorted array, remove the duplicates in place such that each element appear only once and return t... 阅读全文
posted @ 2014-09-03 22:28 Boostable 阅读(133) 评论(0) 推荐(0)

摘要:LeetCode: Search in Rotated Sorted ArraySuppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 ... 阅读全文
posted @ 2014-09-03 22:22 Boostable 阅读(195) 评论(0) 推荐(0)

摘要:LeetCode: Remove Duplicates from Sorted ListGiven a sorted linked list, delete all duplicates such that each element appear only once. For example,Giv... 阅读全文
posted @ 2014-09-03 21:57 Boostable 阅读(152) 评论(0) 推荐(0)

摘要:LeetCode: Maximal RectangleGiven a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area.地址:htt... 阅读全文
posted @ 2014-09-03 21:51 Boostable 阅读(222) 评论(0) 推荐(0)

摘要:LeetCode: Largest Rectangle in HistogramGiven n non-negative integers representing the histogram's bar height where the width of each bar is 1, find t... 阅读全文
posted @ 2014-09-03 21:21 Boostable 阅读(272) 评论(0) 推荐(0)

摘要:LeetCode: Partition ListGiven a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.Y... 阅读全文
posted @ 2014-09-01 22:16 Boostable 阅读(199) 评论(0) 推荐(0)

摘要:LeetCode: Scramble StringGiven a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is o... 阅读全文
posted @ 2014-09-01 22:08 Boostable 阅读(227) 评论(0) 推荐(0)

摘要:LeetCode: Merge Sorted ArrayGiven two sorted integer arrays A and B, merge B into A as one sorted array. Note:You may assume that A has enough space (... 阅读全文
posted @ 2014-09-01 21:56 Boostable 阅读(188) 评论(0) 推荐(0)

摘要:LeetCode: Gray CodeThe gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n represen... 阅读全文
posted @ 2014-09-01 21:53 Boostable 阅读(221) 评论(0) 推荐(0)