当前标签：Greedy

1 2 3 下一页
LeetCode 2952. Minimum Number of Coins to be Added
Dylan_Java_NYC 2024-08-22 22:44 阅读:57 评论:0 推荐:0
LeetCode 1383. Maximum Performance of a Team
Dylan_Java_NYC 2024-08-13 23:43 阅读:54 评论:0 推荐:0
LeetCode 1058. Minimize Rounding Error to Meet Target
Dylan_Java_NYC 2024-08-03 04:41 阅读:66 评论:0 推荐:0
LeetCode 2263. Make Array Non-decreasing or Non-increasing
Dylan_Java_NYC 2024-07-15 23:38 阅读:77 评论:0 推荐:0
LeetCode 857. Minimum Cost to Hire K Workers
Dylan_Java_NYC 2024-07-02 11:03 阅读:30 评论:0 推荐:0
LeetCode 1013. Partition Array Into Three Parts With Equal Sum
Dylan_Java_NYC 2024-07-01 12:00 阅读:31 评论:0 推荐:0
LeetCode 2268. Minimum Number of Keypresses
Dylan_Java_NYC 2024-06-17 20:59 阅读:40 评论:0 推荐:0
LeetCode 2340. Minimum Adjacent Swaps to Make a Valid Array
Dylan_Java_NYC 2024-06-17 13:49 阅读:58 评论:0 推荐:0
LeetCode 1353. Maximum Number of Events That Can Be Attended
Dylan_Java_NYC 2024-05-18 11:11 阅读:34 评论:0 推荐:0
LeetCode 2611. Mice and Cheese
Dylan_Java_NYC 2024-05-13 07:03 阅读:22 评论:0 推荐:0
LeetCode 2116. Check if a Parentheses String Can Be Valid
Dylan_Java_NYC 2024-02-25 03:01 阅读:31 评论:0 推荐:0
LeetCode 2007. Find Original Array From Doubled Array
Dylan_Java_NYC 2022-09-17 06:32 阅读:44 评论:0 推荐:0
LeetCode 1710. Maximum Units on a Truck
Dylan_Java_NYC 2022-08-12 08:15 阅读:79 评论:0 推荐:0
LeetCode 1567. Maximum Length of Subarray With Positive Product
Dylan_Java_NYC 2022-08-12 07:58 阅读:170 评论:0 推荐:0
LeetCode 1400. Construct K Palindrome Strings
Dylan_Java_NYC 2022-08-04 14:39 阅读:37 评论:0 推荐:0
LeetCode 945. Minimum Increment to Make Array Unique
Dylan_Java_NYC 2022-07-19 07:59 阅读:111 评论:0 推荐:0
LeetCode 1541. Minimum Insertions to Balance a Parentheses String
Dylan_Java_NYC 2022-05-01 06:30 阅读:85 评论:0 推荐:0
LeetCode 1963. Minimum Number of Swaps to Make the String Balanced
Dylan_Java_NYC 2022-05-01 05:52 阅读:161 评论:0 推荐:0
LeetCode 1029. Two City Scheduling
Dylan_Java_NYC 2020-02-17 13:49 阅读:307 评论:0 推荐:0
LeetCode 1055. Shortest Way to Form String
Dylan_Java_NYC 2020-01-17 08:52 阅读:1670 评论:0 推荐:0
1 2 3 下一页