Leetcode & Lintcode - 随笔分类 - dingjunnan

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 阅读(166) 评论(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 : Binary Search Tree Iterator

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

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

LintCode : Lowest Common Ancestor

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

posted @ 2016-04-21 18:05 dingjunnan 阅读(113) 评论(0) 推荐(0)

LintCode : Remove Node in Binary Search Tree

摘要：LintCode : Remove Node in Binary Search Tree 阅读全文

posted @ 2016-04-21 17:34 dingjunnan 阅读(131) 评论(0) 推荐(0)

LintCode : Balanced Binary Tree

摘要：LintCode : Balanced Binary Tree 阅读全文