05 2022 档案
摘要：Given two binary search trees root1 and root2, return a list containing all the integers from both trees sorted in ascending order. Example 1: Input:
阅读全文
摘要：Given the root of a binary tree, return the sum of values of its deepest leaves. Example 1: Input: root = [1,2,3,4,5,null,6,7,null,null,null,null,8] O
阅读全文
摘要：You are given a square board of characters. You can move on the board starting at the bottom right square marked with the character 'S'. You need to r
阅读全文
摘要：Given an array arr, replace every element in that array with the greatest element among the elements to its right, and replace the last element with -
阅读全文
摘要：You have n boxes labeled from 0 to n - 1. You are given four arrays: status, candies, keys, and containedBoxes where: status[i] is 1 if the ith box is
阅读全文
摘要：Given an integer array arr and a target value target, return the integer value such that when we change all the integers larger than value in the give
阅读全文
摘要：Given a string s, return the maximum number of ocurrences of any substring under the following rules: The number of unique characters in the substring
阅读全文
