Given a binary tree, check whether it is mirror - symmetric. For example, binary trees [1,2,2,3,4,4,3] are symmetric. But the following [1,2,2,null,3,null,3] is not mirrored
Topic design a simplified version of Twitter (Twitter), users can realize sending tweets, follow/unfollow other users, can see the following people (including their own) of...
Maintains an array of timestamps for each request; The elements in this array are ordered, ascending; The maximum - minimum timestamp in this array <=3000;...
This article is about binary tree depth traversal, want to see the breadth traversal can retreat. This article will use recursion and iteration to traverse...
This is a sequence of 334. Increasing triplets in LeetCode. The difficulty is medium. Tag: "LIS", "longest ascending subsequence", "greedy", "dichotomous" give you an array...