MarkLeeBYR - 博客园

2022年12月

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 阅读(16) 评论(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 阅读(16) 评论(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 阅读(24) 评论(0) 推荐(0)

2022年11月

300. Longest Increasing Subsequence

摘要： Given an integer array nums, return the length of the longest strictly increasing subsequence. Example 1: Input: nums = [10,9,2,5,3,7,101,18] Output: 阅读全文

posted @ 2022-11-30 10:30 MarkLeeBYR 阅读(17) 评论(0) 推荐(0)

295. Find Median from Data Stream

摘要：剑指offer https://www.cnblogs.com/MarkLeeBYR/p/9773495.html 阅读全文

posted @ 2022-11-30 09:59 MarkLeeBYR 阅读(14) 评论(0) 推荐(0)

287. Find the Duplicate Number

摘要：剑指offer 数组中的重复数字 https://www.cnblogs.com/MarkLeeBYR/p/9773954.html 阅读全文

posted @ 2022-11-30 09:44 MarkLeeBYR 阅读(8) 评论(0) 推荐(0)

283. Move Zeroes

摘要： Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. For example, giv 阅读全文

posted @ 2022-11-29 10:01 MarkLeeBYR 阅读(19) 评论(0) 推荐(0)

279. Perfect Squares

摘要： Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n. For example, given n = 12, 阅读全文

posted @ 2022-11-29 09:44 MarkLeeBYR 阅读(16) 评论(0) 推荐(0)

240. Search a 2D Matrix II

摘要：剑指offer 二维数组的查找 https://www.cnblogs.com/MarkLeeBYR/p/9777341.html 阅读全文

posted @ 2022-11-29 00:07 MarkLeeBYR 阅读(13) 评论(0) 推荐(0)

238. Product of Array Except Self

摘要：剑指offer 构建乘积数组 https://www.cnblogs.com/MarkLeeBYR/p/9773723.html 阅读全文

posted @ 2022-11-27 23:58 MarkLeeBYR 阅读(9) 评论(0) 推荐(0)

公告