摘要：
For a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and right child subtrees. A binary tree X is flip e 阅读全文
阅读排行榜
[LeetCode] 76. Minimum Window Substring_Hard tag: two pointers
2021-08-08 09:27 by Johnson_强生仔仔, 32 阅读, 收藏,
摘要：
Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicat 阅读全文
[LeetCode] 763. Partition Labels_Medium Tag: sort
2021-07-29 08:50 by Johnson_强生仔仔, 32 阅读, 收藏,
摘要：
763. Partition Labels Medium 5066206Add to ListShare You are given a string s. We want to partition the string into as many parts as possible so that 阅读全文
[LeetCode] 812. Largest Triangle Area_Easy tag: math
2021-06-06 12:43 by Johnson_强生仔仔, 32 阅读, 收藏,
摘要：
You have a list of points in the plane. Return the area of the largest triangle that can be formed by any 3 of the points. Example: Input: points = [[ 阅读全文
[LeetCode] 163. Missing Ranges_Easy tag: array
2021-08-10 09:54 by Johnson_强生仔仔, 31 阅读, 收藏,
摘要：
You are given an inclusive range [lower, upper] and a sorted unique integer array nums, where all elements are in the inclusive range. A number x is c 阅读全文
浙公网安备 33010602011771号