LeetCode Weekly Contest 98
IT技术小密圈
“IT技术小密圈”公众号致力于为初中级程序员提供实用的编程技巧、经验分享和行业动态,涵盖代码实践、面试技巧和职场经验等多个方面,帮助你快速成长。
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
LeetCode: Weekly Contest 98
LeetCode: Weekly Contest 98题解列表1. LeetCode: 888. Fair Candy Swap 题解2. LeetCode: 890. Find and Replace Pattern 题解3. LeetCode: 889. Construct Binary Tree from Preorder and Postorder Traversal...原创 2018-08-19 11:08:21 · 340 阅读 · 0 评论 -
LeetCode: 888. Fair Candy Swap
LeetCode: 888. Fair Candy Swap题目描述Alice and Bob have candy bars of different sizes: A[i] is the size of the i-th bar of candy that Alice has, and B[j] is the size of the j-th bar of candy that Bob...原创 2018-08-19 11:12:23 · 537 阅读 · 0 评论 -
LeetCode: 890. Find and Replace Pattern
LeetCode: 890. Find and Replace Pattern题目描述You have a list of words and a pattern, and you want to know which words in words matches the pattern.A word matches the pattern if there exists a perm...原创 2018-08-19 11:17:37 · 595 阅读 · 0 评论 -
LeetCode: 889. Construct Binary Tree from Preorder and Postorder Traversal
LeetCode: 889. Construct Binary Tree from Preorder and Postorder Traversal题目描述Return any binary tree that matches the given preorder and postorder traversals. Values in the traversals pre and pos...原创 2018-08-19 11:24:15 · 520 阅读 · 0 评论 -
LeetCode: 891. Sum of Subsequence Widths
LeetCode: 891. Sum of Subsequence Widths题目描述Given an array of integers A, consider all non-empty subsequences of A.For any sequence S, let the width of S be the difference between the maximum an...原创 2018-08-19 12:06:26 · 795 阅读 · 0 评论
分享