pku_smile

2015年3月6日

摘要：标题：Container With Most Water通过率：31.9%难度：中等Givennnon-negative integersa1,a2, ...,an, where each represents a point at coordinate (i,ai).nvertical lines... 阅读全文

posted @ 2015-03-06 11:11 pku_smile 阅读(133) 评论(0) 推荐(0) 编辑

leetcode------Minimum Path Sum

摘要：标题：Minimum Path Sum通过率：31.7%难度：中等Given amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of a... 阅读全文

posted @ 2015-03-06 11:02 pku_smile 阅读(146) 评论(0) 推荐(0) 编辑

2015年3月5日

leetcode------Unique Paths II

摘要：标题：Unique Paths II通过率：28%难度：中等Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be... 阅读全文

posted @ 2015-03-05 11:35 pku_smile 阅读(127) 评论(0) 推荐(0) 编辑

leetcode------Unique Paths

摘要：标题：Unique Paths通过率：32.6% 难度：中等A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The robot can only move e... 阅读全文

posted @ 2015-03-05 11:32 pku_smile 阅读(125) 评论(0) 推荐(0) 编辑

2015年3月3日

leetcode------Binary Tree Postorder Traversal

摘要：标题：Binary Tree Postorder Traversal通过率：31.8%难度：难Given a binary tree, return thepostordertraversal of its nodes' values.For example:Given binary tree{1,... 阅读全文

posted @ 2015-03-03 16:54 pku_smile 阅读(95) 评论(0) 推荐(0) 编辑

leetcode------Binary Tree Inorder Traversal

摘要：标题：Binary Tree Inorder Traversal通过率：36.1%难度：中等Given a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2... 阅读全文

posted @ 2015-03-03 16:52 pku_smile 阅读(108) 评论(0) 推荐(0) 编辑

leetcode------Binary Tree Preorder Traversal

摘要：标题：Binary Tree Preorder Traversal通过率：36.2%难度：中等Given a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#... 阅读全文

posted @ 2015-03-03 16:42 pku_smile 阅读(131) 评论(0) 推荐(0) 编辑

leetcode------Rotate Array

摘要：标题：Rotate Array通过率：18.4%难度：简单Rotate an array ofnelements to the right byksteps.For example, withn= 7 andk= 3, the array[1,2,3,4,5,6,7]is rotated to[5,... 阅读全文

posted @ 2015-03-03 16:33 pku_smile 阅读(180) 评论(0) 推荐(0) 编辑

2015年2月25日

leetcode------Validate Binary Search Tree

摘要：标题Validate Binary Search Tree通过率21.9%难度中等Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:T... 阅读全文

posted @ 2015-02-25 11:46 pku_smile 阅读(132) 评论(0) 推荐(0) 编辑

2015年2月20日

leetcode------Unique Binary Search Trees II

摘要：标题：Unique Binary Search Trees II通过率：27.5%难度：中等Givenn, generate all structurally uniqueBST's(binary search trees) that store values 1...n.For example,G... 阅读全文

posted @ 2015-02-20 13:51 pku_smile 阅读(140) 评论(0) 推荐(0) 编辑

yanghg@pku.edu.cn

公告