LeetCode --- 1640. Check Array Formation Through Concatenation 解题报告
Posted 杨鑫newlfe
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了LeetCode --- 1640. Check Array Formation Through Concatenation 解题报告相关的知识，希望对你有一定的参考价值。
You are given an array of distinct integers arr and an array of integer arrays pieces, where the integers in pieces are distinct. Your goal is to form arr by concatenating the arrays in pieces in any order. However, you are not allowed to reorder the integers in each array pieces[i].
Return true if it is possible to form the array arr from pieces. Otherwise, return false.
Example 1:
Input: arr = [15,88], pieces = [[88],[15]] Output: true Explanation: Concatenate [15] then [88]
Example 2:
Input: arr = [49,18,16], pieces = [[16,18,49]] Output: false Explanation:
以上是关于LeetCode --- 1640. Check Array Formation Through Concatenation 解题报告的主要内容，如果未能解决你的问题，请参考以下文章
LeetCode1640 能否连接形成数组[Map] HERODING的LeetCode之路
LeetCode 958. Check Completeness of a Binary Tree
TM1640,TM6932,TM1629,替代VK1640B SSOP24超小体积,超低单价
[LeetCode] 2068. Check Whether Two Strings are Almost Equivalent