05 2016 档案

LintCode : Edit Distance
摘要：Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) 阅读全文

posted @ 2016-05-22 14:02 dingjunnan 阅读(167) 评论(0) 推荐(0)

LintCode : Jump Game II
摘要：Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal is to reach the last index in the minimum number of jumps. 阅读全文

posted @ 2016-05-21 16:06 dingjunnan 阅读(217) 评论(0) 推荐(0)

LintCode : Jump Game
摘要：Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Determine if you are able to reach the last index. 阅读全文

posted @ 2016-05-21 15:37 dingjunnan 阅读(157) 评论(0) 推荐(0)

LintCode : Unique Paths II
摘要：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 space is marked as 1 and 0 respectively in the grid. 阅读全文

posted @ 2016-05-15 21:03 dingjunnan 阅读(158) 评论(0) 推荐(0)

LintCode : Unique Paths
摘要：A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below). How many possible unique paths are there? 阅读全文

posted @ 2016-05-15 20:42 dingjunnan 阅读(134) 评论(0) 推荐(0)

Strong Components
摘要：Definition: Vertices v and w are srongly connected if there is a directed path from v to w and a directed path from w to v. Algorithm: Phase 1, Comput 阅读全文

posted @ 2016-05-01 11:58 dingjunnan 阅读(130) 评论(0) 推荐(0)

Topological Sort
摘要：Topological Sort 阅读全文

posted @ 2016-05-01 11:46 dingjunnan 阅读(401) 评论(0) 推荐(0)

导航