当前标签：LeetCode

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 1359. Count All Valid Pickup and Delivery Options

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

LeetCode 1834. Single-Threaded CPU

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

LeetCode 1790. Check if One String Swap Can Make Strings Equal

Dylan_Java_NYC 2024-08-12 05:52 阅读:1 评论:0 推荐:0 编辑

LeetCode 1631. Path With Minimum Effort

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

LeetCode 1387. Sort Integers by The Power Value

Dylan_Java_NYC 2024-08-04 12:20 阅读:6 评论: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 1554. Strings Differ by One Character

Dylan_Java_NYC 2024-08-04 02:56 阅读:5 评论:0 推荐:0 编辑

LeetCode 1557. Minimum Number of Vertices to Reach All Nodes

Dylan_Java_NYC 2024-08-04 02:26 阅读:4 评论: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 2189. Number of Ways to Build House of Cards

Dylan_Java_NYC 2024-08-04 00:49 阅读:20 评论:0 推荐:0 编辑

LeetCode 1041. Robot Bounded In Circle

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

LeetCode 1017. Convert to Base -2

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

LeetCode 1058. Minimize Rounding Error to Meet Target

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

LeetCode 756. Pyramid Transition Matrix

Dylan_Java_NYC 2024-07-30 13:35 阅读:5 评论: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 编辑