12 2022 档案

673.Number of Longest Increasing Subsequence
摘要：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 two l 阅读全文
posted @ 2022-12-13 00:23 MarkLeeBYR 阅读(12) 评论(0) 推荐(0) 编辑
347.TopK Frequent Elements
摘要：Given a non-empty array of integers, return the k most frequent elements. Example 1: Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2] Example 2: Input 阅读全文
posted @ 2022-12-02 11:34 MarkLeeBYR 阅读(14) 评论(0) 推荐(0) 编辑
322.CoinChange
摘要：Example 1: Input: coins = [1,2,5], amount = 11 Output: 3 Explanation: 11 = 5 + 5 + 1 Example 2: Input: coins = [2], amount = 3 Output: -1 Example 3: I 阅读全文
posted @ 2022-12-02 10:37 MarkLeeBYR 阅读(14) 评论(0) 推荐(0) 编辑