摘要：
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 fol... 阅读全文
posted @ 2015-07-22 22:45
~每天进步一点点~
阅读(123)
评论(0)
推荐(0)
摘要：
Given an indexk, return thekthrow of the Pascal's triangle.For example, givenk= 3,Return[1,3,3,1].public class Solution { public List getRow(int ro... 阅读全文
posted @ 2015-07-22 22:18
~每天进步一点点~
阅读(131)
评论(0)
推荐(0)
摘要：
GivennumRows, generate the firstnumRowsof Pascal's triangle.For example, givennumRows= 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]... 阅读全文
posted @ 2015-07-22 21:58
~每天进步一点点~
阅读(118)
评论(0)
推荐(0)
摘要：
Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution stil... 阅读全文
posted @ 2015-07-22 21:33
~每天进步一点点~
阅读(138)
评论(0)
推荐(0)
摘要：
Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointe... 阅读全文
posted @ 2015-07-22 21:10
~每天进步一点点~
阅读(147)
评论(0)
推荐(0)
摘要：
Given a stringSand a stringT, count the number of distinct subsequences ofTinS.A subsequence of a string is a new string which is formed from the orig... 阅读全文
posted @ 2015-07-22 20:49
~每天进步一点点~
阅读(139)
评论(0)
推荐(0)
摘要：
Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened t... 阅读全文
posted @ 2015-07-22 20:11
~每天进步一点点~
阅读(120)
评论(0)
推荐(0)
摘要：
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree andsum =... 阅读全文
posted @ 2015-07-22 18:48
~每天进步一点点~
阅读(110)
评论(0)
推荐(0)
摘要：
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Fo... 阅读全文
posted @ 2015-07-22 17:54
~每天进步一点点~
阅读(113)
评论(0)
推荐(0)
摘要：
Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest le... 阅读全文
posted @ 2015-07-22 13:10
~每天进步一点点~
阅读(145)
评论(0)
推荐(0)
浙公网安备 33010602011771号