JSRGFJZ6 - 博客园

摘要：题目：Given a string s, partition s such that every substring of the partition is a palindrome.Return... 阅读全文

posted @ 2015-10-21 22:08 JSRGFJZ6 阅读(128) 评论(0) 推荐(0) 编辑

摘要：题目：Given a string s, partition s such that every substring of the partition is a palindrome.Return... 阅读全文

posted @ 2015-10-21 22:06 JSRGFJZ6 阅读(101) 评论(0) 推荐(0) 编辑

摘要：题目：Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right ... 阅读全文

posted @ 2015-10-21 22:02 JSRGFJZ6 阅读(92) 评论(0) 推荐(0) 编辑

摘要：题目：Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the ... 阅读全文

posted @ 2015-10-20 19:53 JSRGFJZ6 阅读(102) 评论(0) 推荐(0) 编辑

摘要：题目：Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the ... 阅读全文

posted @ 2015-10-20 19:51 JSRGFJZ6 阅读(123) 评论(0) 推荐(0) 编辑

摘要：题目：Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.F... 阅读全文

posted @ 2015-10-19 07:57 JSRGFJZ6 阅读(133) 评论(0) 推荐(0) 编辑

摘要：题目：Given n, how many structurally unique BST's (binary search trees) that store values 1...n ?For ... 阅读全文

posted @ 2015-10-18 22:53 JSRGFJZ6 阅读(74) 评论(0) 推荐(0) 编辑

摘要：题目：Given a collection of intervals, merge all overlapping intervals.For example,Given [1,3],[2,6],... 阅读全文

posted @ 2015-10-17 14:05 JSRGFJZ6 阅读(114) 评论(0) 推荐(0) 编辑

摘要：题目：Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Not... 阅读全文

posted @ 2015-10-17 13:48 JSRGFJZ6 阅读(94) 评论(0) 推荐(0) 编辑

摘要：题目：Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many un... 阅读全文

posted @ 2015-10-16 20:56 JSRGFJZ6 阅读(119) 评论(0) 推荐(0) 编辑

Jean