Fork me on GitHub
摘要: Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. 阅读全文
posted @ 2017-03-04 17:47 hellowOOOrld 阅读(139) 评论(0) 推荐(0) 编辑
摘要: You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo 阅读全文
posted @ 2017-03-04 15:03 hellowOOOrld 阅读(132) 评论(0) 推荐(0) 编辑