2019年9月27日
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 @ 2019-09-27 03:08 Schwifty 阅读(167) 评论(0) 推荐(0)
330. Patching Array
摘要： Given a sorted positive integer array nums and an integer n, add/patch elements to the array such that any number in range [1, n] inclusive can be for 阅读全文
posted @ 2019-09-27 02:21 Schwifty 阅读(141) 评论(0) 推荐(0)