摘要：
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16 ...) which sum to n. For example, given n = 12, 阅读全文
posted @ 2016-12-17 11:56
Dragonir
阅读(218)
评论(0)
推荐(0)
摘要：
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the fo 阅读全文
posted @ 2016-12-17 11:55
Dragonir
阅读(306)
评论(0)
推荐(0)
摘要：
Given n, how many structurally unique BST's (binary search trees) that store values 1...n? For example, given n = 3, there are a total of 5 unique BST 阅读全文
posted @ 2016-12-17 10:54
Dragonir
阅读(178)
评论(0)
推荐(0)
摘要：
1. Maximum Subarray (#53) Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given 阅读全文
posted @ 2016-12-17 10:18
Dragonir
阅读(271)
评论(0)
推荐(0)
浙公网安备 33010602011771号