DP - 标签 - Dylan_Java_NYC

LeetCode 1359. Count All Valid Pickup and Delivery Options

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

LeetCode 1387. Sort Integers by The Power Value

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

LeetCode 2189. Number of Ways to Build House of Cards

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

LeetCode 2263. Make Array Non-decreasing or Non-increasing

Dylan_Java_NYC 2024-07-15 23:38 阅读:39 评论:0 推荐:0 编辑

LeetCode 1411. Number of Ways to Paint N × 3 Grid

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

LeetCode 918. Maximum Sum Circular Subarray

Dylan_Java_NYC 2024-05-17 10:40 阅读:14 评论:0 推荐:0 编辑

LeetCode 1186. Maximum Subarray Sum with One Deletion

Dylan_Java_NYC 2024-05-09 12:37 阅读:5 评论:0 推荐:0 编辑

LeetCode 2060. Check if an Original String Exists Given Two Encoded Strings

Dylan_Java_NYC 2024-05-07 12:33 阅读:34 评论:0 推荐:0 编辑

LeetCode 2597. The Number of Beautiful Subsets

Dylan_Java_NYC 2024-05-06 11:15 阅读:62 评论:0 推荐:0 编辑

LeetCode 834. Sum of Distances in Tree

Dylan_Java_NYC 2024-03-23 23:18 阅读:26 评论:0 推荐:0 编辑

LeetCode 1770. Maximum Score from Performing Multiplication Operations

Dylan_Java_NYC 2022-09-16 11:01 阅读:55 评论:0 推荐:0 编辑

LeetCode 1567. Maximum Length of Subarray With Positive Product

Dylan_Java_NYC 2022-08-12 07:58 阅读:139 评论:0 推荐:0 编辑

LeetCode 2272. Substring With Largest Variance

Dylan_Java_NYC 2022-07-30 15:06 阅读:583 评论:0 推荐:0 编辑

LeetCode 828. Count Unique Characters of All Substrings of a Given String

Dylan_Java_NYC 2022-07-26 05:46 阅读:163 评论:0 推荐:0 编辑

LeetCode 2262. Total Appeal of A String

Dylan_Java_NYC 2022-07-25 08:59 阅读:210 评论:0 推荐:0 编辑

LeetCode 1235. Maximum Profit in Job Scheduling

Dylan_Java_NYC 2022-07-19 02:24 阅读:87 评论:0 推荐:0 编辑

LeetCode 354. Russian Doll Envelopes

Dylan_Java_NYC 2022-06-21 14:21 阅读:26 评论:0 推荐:0 编辑

LeetCode 730. Count Different Palindromic Subsequences

Dylan_Java_NYC 2020-03-20 14:23 阅读:222 评论:0 推荐:0 编辑

LeetCode 926. Flip String to Monotone Increasing

Dylan_Java_NYC 2020-03-08 14:17 阅读:207 评论:0 推荐:0 编辑

LeetCode 1269. Number of Ways to Stay in the Same Place After Some Steps

Dylan_Java_NYC 2020-03-02 14:04 阅读:476 评论:0 推荐:0 编辑

当前标签：DP

公告

搜索

常用链接

我的标签

随笔档案

阅读排行榜

评论排行榜

最新评论