2018年2月1日

[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 maxim 阅读全文
posted @ 2018-02-01 12:29 codingEskimo 阅读(101) 评论(0) 推荐(0) 编辑
[LintCode] Knight Shortest Path II
摘要： Given a knight in a chessboard n * m (a binary matrix with 0 as empty and 1 as barrier). the knight initialze position is (0, 0) and he wants to reach 阅读全文
posted @ 2018-02-01 11:54 codingEskimo 阅读(320) 评论(0) 推荐(0) 编辑
[LintCode] 汇总 summary
摘要： 76. Longest Increasing Subsequence 116. Jump Game 603. Largest Divisible Subset 611. Knight Shortest Path 630. Knight Shortest Path II 116. Jump Game 阅读全文
posted @ 2018-02-01 11:44 codingEskimo 阅读(105) 评论(0) 推荐(0) 编辑

导航