当前标签：Array

LeetCode 2952. Minimum Number of Coins to be Added

Dylan_Java_NYC 2024-08-22 22:44 阅读:1 评论:0 推荐:0 编辑

LeetCode 2049. Count Nodes With the Highest Score

Dylan_Java_NYC 2024-08-14 00:29 阅读:2 评论:0 推荐:0 编辑

LeetCode 1383. Maximum Performance of a Team

Dylan_Java_NYC 2024-08-13 23:43 阅读:5 评论:0 推荐:0 编辑

LeetCode 1834. Single-Threaded CPU

Dylan_Java_NYC 2024-08-12 11:30 阅读:2 评论:0 推荐:0 编辑

LeetCode 1631. Path With Minimum Effort

Dylan_Java_NYC 2024-08-05 23:03 阅读:3 评论:0 推荐:0 编辑

LeetCode 3076. Shortest Uncommon Substring in an Array

Dylan_Java_NYC 2024-08-04 04:32 阅读:3 评论:0 推荐:0 编辑

LeetCode 2043. Simple Bank System

Dylan_Java_NYC 2024-08-04 03:35 阅读:1 评论:0 推荐:0 编辑

LeetCode 1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix

Dylan_Java_NYC 2024-08-04 01:30 阅读:2 评论:0 推荐:0 编辑

LeetCode 1058. Minimize Rounding Error to Meet Target

Dylan_Java_NYC 2024-08-03 04:41 阅读:4 评论:0 推荐:0 编辑

LeetCode 864. Shortest Path to Get All Keys

Dylan_Java_NYC 2024-07-25 13:20 阅读:2 评论:0 推荐:0 编辑

LeetCode 1298. Maximum Candies You Can Get from Boxes

Dylan_Java_NYC 2024-07-16 13:43 阅读:6 评论:0 推荐:0 编辑

LeetCode 928. Minimize Malware Spread II

Dylan_Java_NYC 2024-07-16 01:07 阅读:3 评论:0 推荐:0 编辑

LeetCode 857. Minimum Cost to Hire K Workers

Dylan_Java_NYC 2024-07-02 11:03 阅读:4 评论:0 推荐:0 编辑

LeetCode 1013. Partition Array Into Three Parts With Equal Sum

Dylan_Java_NYC 2024-07-01 12:00 阅读:3 评论:0 推荐:0 编辑

LeetCode 2055. Plates Between Candles

Dylan_Java_NYC 2024-06-18 09:20 阅读:7 评论:0 推荐:0 编辑

LeetCode 2340. Minimum Adjacent Swaps to Make a Valid Array

Dylan_Java_NYC 2024-06-17 13:49 阅读:5 评论:0 推荐:0 编辑

LeetCode 2781. Length of the Longest Valid Substring

Dylan_Java_NYC 2024-06-17 13:34 阅读:7 评论:0 推荐:0 编辑

LeetCode 1748. Sum of Unique Elements

Dylan_Java_NYC 2024-06-04 11:54 阅读:1 评论:0 推荐:0 编辑

LeetCode 720. Longest Word in Dictionary

Dylan_Java_NYC 2024-06-03 12:50 阅读:2 评论:0 推荐:0 编辑

LeetCode 1460. Make Two Arrays Equal by Reversing Subarrays

Dylan_Java_NYC 2024-06-02 23:54 阅读:5 评论:0 推荐:0 编辑