2015年8月27日
[LeetCode] Dungeon Game
摘要： An interesting problem. The code is also short and clear.The basic idea is to use a 2d array dp[i][j] to denote the minimum hp that is required before... 阅读全文
posted @ 2015-08-27 18:15 jianchao-li 阅读(501) 评论(0) 推荐(0)
[LeetCode] Closest Binary Search Tree Value
摘要： Problem Description:Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target.Note:Given target... 阅读全文
posted @ 2015-08-27 14:28 jianchao-li 阅读(2906) 评论(0) 推荐(0)