03 2024 档案

摘要:原题链接在这里:https://leetcode.com/problems/product-of-two-run-length-encoded-arrays/description/ 题目: Run-length encoding is a compression algorithm that al 阅读全文
posted @ 2024-03-31 00:46 Dylan_Java_NYC 阅读(25) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/making-a-large-island/description/ 题目: You are given an n x n binary matrix grid. You are allowed to change at m 阅读全文
posted @ 2024-03-25 03:32 Dylan_Java_NYC 阅读(18) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/shortest-path-in-a-hidden-grid/description/ 题目: This is an interactive problem. There is a robot in a hidden gri 阅读全文
posted @ 2024-03-24 09:55 Dylan_Java_NYC 阅读(93) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/sum-of-distances-in-tree/description/ 题目: There is an undirected connected tree with n nodes labeled from 0 to n 阅读全文
posted @ 2024-03-23 23:18 Dylan_Java_NYC 阅读(26) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/count-nodes-equal-to-average-of-subtree/description/ 题目: Given the root of a binary tree, return the number of n 阅读全文
posted @ 2024-03-21 11:22 Dylan_Java_NYC 阅读(3) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/description/ 题目: Given the root of a binary tree, the level of its root is 1, 阅读全文
posted @ 2024-03-20 10:35 Dylan_Java_NYC 阅读(4) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/description/ 题目: We run a preorder depth-first search (DFS) on the root o 阅读全文
posted @ 2024-03-20 10:08 Dylan_Java_NYC 阅读(3) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/print-immutable-linked-list-in-reverse/description/题目: You are given an immutable linked list, print out all val 阅读全文
posted @ 2024-03-18 05:35 Dylan_Java_NYC 阅读(17) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/design-skiplist/description/ 题目: Design a Skiplist without using any built-in libraries. A skiplist is a data st 阅读全文
posted @ 2024-03-18 02:42 Dylan_Java_NYC 阅读(10) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/dot-product-of-two-sparse-vectors/description/ 题目: Given two sparse vectors, compute their dot product. Implemen 阅读全文
posted @ 2024-03-03 03:48 Dylan_Java_NYC 阅读(86) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/finding-the-number-of-visible-mountains/description/ 题目: You are given a 0-indexed 2D integer array peaks where  阅读全文
posted @ 2024-03-01 13:07 Dylan_Java_NYC 阅读(31) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示