摘要: 题目: Given an unsorted array of integers, find the number of longest increasing subsequence. Example 1: Input: [1,3,5,4,7] Output: 2 Explanation: The t 阅读全文
posted @ 2020-01-17 17:54 silentteller 阅读(177) 评论(0) 推荐(0) 编辑
摘要: 题目: You are asked to cut off trees in a forest for a golf event. The forest is represented as a non-negative 2D map, in this map: 0 represents the obs 阅读全文
posted @ 2020-01-17 15:51 silentteller 阅读(274) 评论(0) 推荐(0) 编辑