765-情侣牵手(Couples Holding Hands) 原文链接: https://leetcode-cn.com/problems/couples-holding-hands 英文原文There are n couples sitting in 2n seats arranged in a 2021-12-03 图并查集广度优先搜索深度优先搜索贪心 困难
427-建立四叉树(Construct Quad Tree) 原文链接: https://leetcode-cn.com/problems/construct-quad-tree 英文原文Given a n * n matrix grid of 0's and 1's only. 2021-12-03 分治数组树矩阵 中等
558-四叉树交集(Logical OR of Two Binary Grids Represented as Quad-Trees) 原文链接: https://leetcode-cn.com/problems/logical-or-of-two-binary-grids-represented-as-quad-trees 英文原文A Binary Matrix is 2021-12-03 分治树 中等
559-N 叉树的最大深度(Maximum Depth of N-ary Tree) 原文链接: https://leetcode-cn.com/problems/maximum-depth-of-n-ary-tree 英文原文Given a n-ary tree, find its maximum depth. Th 2021-12-03 广度优先搜索树深度优先搜索 简单
590-N 叉树的后序遍历(N-ary Tree Postorder Traversal) 原文链接: https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal 英文原文Given the root of an n-ary tree, return the 2021-12-03 栈树深度优先搜索 简单
766-托普利茨矩阵(Toeplitz Matrix) 原文链接: https://leetcode-cn.com/problems/toeplitz-matrix 英文原文Given an m x n matrix, return true if the matrix 2021-12-03 数组矩阵 简单
767-重构字符串(Reorganize String) 原文链接: https://leetcode-cn.com/problems/reorganize-string 英文原文Given a string s, rearrange the characters of s so that a 2021-12-03 哈希表堆(优先队列)字符串排序计数贪心 中等
768-最多能完成排序的块 II(Max Chunks To Make Sorted II) 原文链接: https://leetcode-cn.com/problems/max-chunks-to-make-sorted-ii 英文原文You are given an integer array arr. We split 2021-12-03 单调栈排序数组栈贪心 困难
769-最多能完成排序的块(Max Chunks To Make Sorted) 原文链接: https://leetcode-cn.com/problems/max-chunks-to-make-sorted 英文原文You are given an integer array arr of length n th 2021-12-03 单调栈排序数组栈贪心 中等
770-基本计算器 IV(Basic Calculator IV) 原文链接: https://leetcode-cn.com/problems/basic-calculator-iv 英文原文Given an expression such as expression = "e + 8 - 2021-12-03 哈希表字符串数学栈递归 困难