YRB

2015年4月19日

摘要：题目： Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transac 阅读全文

posted @ 2015-04-19 00:14 YRB 阅读(390) 评论(0) 推荐(0) 编辑

120. 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 th 阅读全文

posted @ 2015-04-19 00:13 YRB 阅读(403) 评论(0) 推荐(0) 编辑

119. Pascal's Triangle II

摘要：题目： Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3,Return [1,3,3,1]. 链接： http://leetcode.com/problems/pascals 阅读全文

posted @ 2015-04-19 00:11 YRB 阅读(450) 评论(0) 推荐(0) 编辑

118. Pascal's Triangle

摘要：题目： Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5,Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1 阅读全文

posted @ 2015-04-19 00:10 YRB 阅读(621) 评论(0) 推荐(0) 编辑

2015年4月18日

117. Populating Next Right Pointers in Each Node II

摘要：题目： 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 阅读全文

posted @ 2015-04-18 15:19 YRB 阅读(1159) 评论(0) 推荐(0) 编辑

116. Populating Next Right Pointers in Each Node

摘要：题目： Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate each next pointer to point to it 阅读全文

posted @ 2015-04-18 14:03 YRB 阅读(1239) 评论(0) 推荐(0) 编辑

115. Distinct Subsequences

摘要：题目：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 o... 阅读全文

posted @ 2015-04-18 14:02 YRB 阅读(303) 评论(0) 推荐(0) 编辑

114. Flatten Binary Tree to Linked List

摘要：题目： Given a binary tree, flatten it to a linked list in-place. For example,Given The flattened tree should look like: click to show hints. Hints: If y 阅读全文

posted @ 2015-04-18 14:01 YRB 阅读(677) 评论(0) 推荐(0) 编辑

113. Path Sum II

摘要：题目： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. return 链接： http://leetcode.com/problems/pat 阅读全文

posted @ 2015-04-18 13:59 YRB 阅读(609) 评论(0) 推荐(0) 编辑

112. Path Sum

摘要：题目： 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 su 阅读全文

posted @ 2015-04-18 13:58 YRB 阅读(696) 评论(0) 推荐(0) 编辑

公告