2017年3月13日
[leetcode DP]120. Triangle
摘要： Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the fo 阅读全文
posted @ 2017-03-13 23:14 wilderness 阅读(120) 评论(0) 推荐(0)
[leetcode DP]91. Decode Ways
摘要： A message containing letters from A-Z is being encoded to numbers using the following mapping: Given an encoded message containing digits, determine t 阅读全文
posted @ 2017-03-13 14:14 wilderness 阅读(168) 评论(0) 推荐(0)