2017年3月1日
Minimum Path Sum Leetcode
摘要： 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-01 09:31 璨璨要好好学习 阅读(112) 评论(0) 推荐(0)
Inorder Successor in BST Leetcode
摘要： Given a binary search tree and a node in it, find the in-order successor of that node in the BST. Note: If the given node has no in-order successor in 阅读全文
posted @ 2017-03-01 08:37 璨璨要好好学习 阅读(136) 评论(0) 推荐(0)