一、题目原型： 给定两个大小为 m 和 n 的有序数组 nums1 和 nums2 。请找出这两个有序数组的中位数。要求算法的时间复杂度为 O(...

Given a binary tree and a sum, find all root-to-leaf paths where each pa...

Given a binary tree, find the leftmost value in the last row of the tree...

Given a binary tree and a sum, determine if the tree has a root-to-leaf ...

Given a binary tree, find its maximum depth. The maximum depth is the nu...

Given a string representing arbitrarily nested ternary expressions, calc...

题目 In a given integer array nums, there is always exactly one largest el...

题目 Given an array of integers nums, write a method that returns the "piv...

题目的通过率越来越低，题目越来越长，题意不好理解，边界问题，优化问题叠加，导致解题时间大大增加，对我的目标--快速复习一遍技术数据结构和算法阻碍...

题目 We define the Perfect Number is a positive integer that is equal to t...