01 2016 档案

Binary Tree Maximum Path Sum
摘要：Given a binary tree, find the maximum path sum.For this problem, a path is defined as any sequence of nodes from some starting node to any node in the... 阅读全文
posted @ 2016-01-19 10:29 dylqt 阅读(238) 评论(0) 推荐(0)
Sum Root to Leaf Numbers
摘要：Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which... 阅读全文
posted @ 2016-01-18 11:09 dylqt 阅读(315) 评论(0) 推荐(0)
Longest Increasing Subsequence
摘要：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 increasing subsequence is [2, 3, 7, 101], therefore t... 阅读全文
posted @ 2016-01-14 11:01 dylqt 阅读(192) 评论(0) 推荐(0)
Maximal Square
摘要：Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area. For example, given the following matrix:1 0 1 0 0 1 0 1 1 1 1 1 1 1 1 1 0 0 1 0 Retur... 阅读全文
posted @ 2016-01-13 12:07 dylqt 阅读(230) 评论(0) 推荐(0)
Triangle
摘要：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 following triangle[ [2], [3,4], [6,5,7],... 阅读全文
posted @ 2016-01-11 11:28 dylqt 阅读(210) 评论(0) 推荐(0)
Best Time to Buy and Sell Stock with Cooldown
摘要：Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one a... 阅读全文
posted @ 2016-01-10 18:39 dylqt 阅读(165) 评论(0) 推荐(0)
Minimum Path Sum
摘要：Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. Note: You can only move either down or right at an... 阅读全文
posted @ 2016-01-10 15:10 dylqt 阅读(149) 评论(0) 推荐(0)
Decode Ways
摘要：A message containing letters fromA-Zis being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message conta... 阅读全文
posted @ 2016-01-07 16:33 dylqt 阅读(131) 评论(0) 推荐(0)
Coin Change
摘要：You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money ... 阅读全文
posted @ 2016-01-04 14:14 dylqt 阅读(228) 评论(0) 推荐(0)