LeetCode刷题日记

题目 Given an array of integers heights representing the histogram's bar height where the width of eac

位运算，Trie 题目 Given an integer array nums, return the maximum result of nums[i] XOR nums[j], where 0 <

标签：binary search 题目 Koko loves to eat bananas. There are n piles of bananas, the ith pile has piles[

题目 You have a long flowerbed in which some of the plots are planted, and some are not. However, flow

题目 给定一个二叉树，返回其包含的最大（节点数量最多）二叉搜索树的大小 解法 Brute Force 遍历该树，对每个节点判断其树是否是二叉搜索树（以该节点为根节点的树），时间复杂度为O(N2) 树的

找到相同乘积的组合个数：Given an array nums of distinct positive integers, return the number of tuples