dingjunnan - 博客园

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 阅读(124) 评论(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 阅读(124) 评论(0) 推荐(0) 编辑

Topological Sort

摘要： Topological Sort 阅读全文

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

Dynamic Programming: Weighted Independent Sets in Path Graphs

摘要： Dynamic Programming: Weighted Independent Sets in Path Graphs 阅读全文

posted @ 2016-04-24 20:04 dingjunnan 阅读(148) 评论(0) 推荐(0) 编辑

LintCode : Binary Search Tree Iterator

摘要： LintCode : Binary Search Tree Iterator 阅读全文

posted @ 2016-04-21 21:42 dingjunnan 阅读(136) 评论(0) 推荐(0) 编辑

LintCode : Lowest Common Ancestor

摘要： LintCode : Lowest Common Ancestor 阅读全文