2015年1月26日

leetcode 【 Trapping Rain Water 】python 实现
摘要： 题目：Givennnon-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining... 阅读全文
posted @ 2015-01-26 22:34 承续缘 阅读(311) 评论(0) 推荐(0) 编辑
leetcode 【 Triangle 】python 实现
摘要： 题目：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 ... 阅读全文
posted @ 2015-01-26 19:55 承续缘 阅读(266) 评论(0) 推荐(0) 编辑
leetcode 【 Two Sum 】python 实现
摘要： 题目：Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two... 阅读全文
posted @ 2015-01-26 17:55 承续缘 阅读(155) 评论(0) 推荐(0) 编辑
leetcode 【 Unique Paths II 】 python 实现
摘要： 题目：Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty spac... 阅读全文
posted @ 2015-01-26 16:12 承续缘 阅读(233) 评论(0) 推荐(0) 编辑
leetcode 【 Unique Paths 】python 实现
摘要： 题目：A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The robot can only move either down or right at any poi... 阅读全文
posted @ 2015-01-26 14:59 承续缘 阅读(713) 评论(0) 推荐(0) 编辑

导航