标签： leetcode
-
leetcode讲解–589. N-ary Tree Preorder Traversal
Given an n-ary tree, return the preorder traversal of i…
-
leetcode讲解–961. N-Repeated Element in Size 2N Array
In a array A of size 2N, there are N+1 unique elements,…
-
3. 无重复字符的最长子串
输入: “abcabcbb”输出: 3 解释: 因为无重复字符的最长子串是 “abc”，所以其长度为 3。
-
leetcode讲解–951. Flip Equivalent Binary Trees
For a binary tree T, we can define a flip operation as …
-
leetcode讲解–922. Sort Array By Parity II
Given an array A of non-negative integers, half of the …
-
leetcode讲解–933. Number of Recent Calls
Write a class RecentCounter to count recent requests.
-
leetcode讲解–763. Partition Labels
A string S of lowercase letters is given. We want to pa…
-
leetcode讲解–894. All Possible Full Binary Trees
A full binary tree is a binary tree where each node has…
-
leetcode讲解–861. Score After Flipping Matrix
We have a two dimensional matrix A where each value is …
-
leetcode讲解–561. Array Partition I
Given an array of 2n integers, your task is to group th…