09 2022 档案

摘要:原题链接在这里:https://leetcode.com/problems/deepest-leaves-sum/ 题目: Given the root of a binary tree, return the sum of values of its deepest leaves. Example 阅读全文
posted @ 2022-09-29 16:25 Dylan_Java_NYC 阅读(24) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/design-a-text-editor/ 题目: Design a text editor with a cursor that can do the following: Add text to where the cu 阅读全文
posted @ 2022-09-29 15:39 Dylan_Java_NYC 阅读(50) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/balance-a-binary-search-tree/ 题目: Given the root of a binary search tree, return a balanced binary search tree w 阅读全文
posted @ 2022-09-25 14:57 Dylan_Java_NYC 阅读(44) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/water-and-jug-problem/ 题目: You are given two jugs with capacities jug1Capacity and jug2Capacity liters. There is 阅读全文
posted @ 2022-09-25 07:33 Dylan_Java_NYC 阅读(25) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/find-original-array-from-doubled-array/ 题目: An integer array original is transformed into a doubled array change 阅读全文
posted @ 2022-09-17 06:32 Dylan_Java_NYC 阅读(30) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/maximum-score-from-performing-multiplication-operations/ 题目: You are given two integer arrays nums and multiplie 阅读全文
posted @ 2022-09-16 11:01 Dylan_Java_NYC 阅读(55) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/ 题目: Given the root of a binary tree, split the binary tree into two sub 阅读全文
posted @ 2022-09-10 01:19 Dylan_Java_NYC 阅读(102) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/the-number-of-weak-characters-in-the-game/ 题目: You are playing a game that contains multiple characters, and eac 阅读全文
posted @ 2022-09-09 13:07 Dylan_Java_NYC 阅读(92) 评论(0) 推荐(0) 编辑

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