2015年4月9日
Triangle——LeetCode
摘要： 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 fol... 阅读全文
posted @ 2015-04-09 16:03 丶Blank 阅读(131) 评论(0) 推荐(0) 编辑
Best Time to Buy and Sell Stock II ——LeetCode
摘要： Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a... 阅读全文
posted @ 2015-04-09 12:15 丶Blank 阅读(134) 评论(0) 推荐(0) 编辑
Best Time to Buy and Sell Stock——LeetCode
摘要： Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie... 阅读全文
posted @ 2015-04-09 00:36 丶Blank 阅读(122) 评论(0) 推荐(0) 编辑
Number of Islands——LeetCode
摘要： Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacen 阅读全文
posted @ 2015-04-09 00:04 丶Blank 阅读(753) 评论(0) 推荐(0) 编辑