1483-树节点的第 K 个祖先(Kth Ancestor of a Tree Node) 原文链接: https://leetcode-cn.com/problems/kth-ancestor-of-a-tree-node 英文原文You are given a tree with n nodes numbered from 2021-12-03 二分查找动态规划广度优先搜索树深度优先搜索设计 困难
1954-收集足够苹果的最小花园周长(Minimum Garden Perimeter to Collect Enough Apples) 原文链接: https://leetcode-cn.com/problems/minimum-garden-perimeter-to-collect-enough-apples 英文原文In a garden represented a 2021-12-03 二分查找数学 中等
1189-“气球” 的最大数量(Maximum Number of Balloons) 原文链接: https://leetcode-cn.com/problems/maximum-number-of-balloons 英文原文Given a string text, you want to use the charact 2021-12-03 哈希表字符串计数 简单
1190-反转每对括号间的子串(Reverse Substrings Between Each Pair of Parentheses) 原文链接: https://leetcode-cn.com/problems/reverse-substrings-between-each-pair-of-parentheses 英文原文You are given a string 2021-12-03 字符串栈 中等
1191-K 次串联后最大子数组之和(K-Concatenation Maximum Sum) 原文链接: https://leetcode-cn.com/problems/k-concatenation-maximum-sum 英文原文Given an integer array arr and an integer k, mo 2021-12-03 动态规划数组 中等
1192-查找集群内的「关键连接」(Critical Connections in a Network) 原文链接: https://leetcode-cn.com/problems/critical-connections-in-a-network 英文原文There are n servers numbered from 0 to n 2021-12-03 双连通分量图深度优先搜索 困难
1179-重新格式化部门表(Reformat Department Table) 原文链接: https://leetcode-cn.com/problems/reformat-department-table 英文原文Table: Department +-------------+---------+ | C 2021-12-03 数据库 简单
1957-删除字符使字符串变好(Delete Characters to Make Fancy String) 原文链接: https://leetcode-cn.com/problems/delete-characters-to-make-fancy-string 英文原文A fancy string is a string where no 2021-12-03 字符串 简单
1405-最长快乐字符串(Longest Happy String) 原文链接: https://leetcode-cn.com/problems/longest-happy-string 英文原文A string is called happy if it does not have any 2021-12-03 堆(优先队列)字符串贪心 中等
1944-队列中可以看到的人数(Number of Visible People in a Queue) 原文链接: https://leetcode-cn.com/problems/number-of-visible-people-in-a-queue 英文原文There are n people standing in a queue, 2021-12-03 单调栈数组栈 困难