摘要：
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo 阅读全文
posted @ 2016-08-01 15:02
LiBlog
阅读(158)
评论(0)
推荐(0)
摘要：
Given a binary tree, return the vertical order traversal of its nodes' values. (ie, from top to bottom, column by column). If two nodes are in the sam 阅读全文
posted @ 2016-08-01 14:32
LiBlog
阅读(140)
评论(0)
推荐(0)
摘要：
Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: Your algorithm 阅读全文
posted @ 2016-08-01 09:54
LiBlog
阅读(156)
评论(0)
推荐(0)
摘要：
Given an unsorted array of integers, find the length of longest increasing subsequence. For example, Given [10, 9, 2, 5, 3, 7, 101, 18], The longest i 阅读全文
posted @ 2016-08-01 09:37
LiBlog
阅读(124)
评论(0)
推荐(0)
摘要：
You have a number of envelopes with widths and heights given as a pair of integers (w, h). One envelope can fit into another if and only if both the w 阅读全文
posted @ 2016-08-01 09:30
LiBlog
阅读(182)
评论(0)
推荐(0)
浙公网安备 33010602011771号