X

LEETCODE周赛188 赛后总结及解题思路分析

LEETCODE 1441. Build an Array With Stack Operations

难度:简单

考点:栈,数组,List的概念

LEETCODE 1441. Build an Array With Stack Operations 解题思路分析


LEETCODE 1442. Count Triplets That Can Form Two Arrays of Equal XOR

难度:中等

考点:亦或运算,前缀数组

LEETCODE 1442. Count Triplets That Can Form Two Arrays of Equal XOR 解题思路分析


LEETCODE 1443. Minimum Time to Collect All Apples in a Tree

难度:中等

考点:树形结构,深度优先搜索(dfs)

LEETCODE 1443. Minimum Time to Collect All Apples in a Tree 解题思路分析


LEETCODE 1444. Number of Ways of Cutting a Pizza

难度:困难

考点:动态规划(DP),递归

LEETCODE 1444. Number of Ways of Cutting a Pizza 解题思路分析

本网站文章均为原创内容,并可随意转载,但请标明本文链接
如有任何疑问可在文章底部留言。为了防止恶意评论,本博客现已开启留言审核功能。但是博主会在后台第一时间看到您的留言,并会在第一时间对您的留言进行回复!欢迎交流!
本文链接: http://leetcode.jp/leetcode周赛188-赛后总结及解题思路分析/
Categories: leetcode
kwantong:

View Comments (2)