Python 基础知识简单

数组子集检查

“数组子集检查”问题的详细指南和 Python 实现。

问题陈述

简单

编写一个函数 is_subset(arr1, arr2) 来检查 arr1 是否是 arr2 的子集。如果 arr1 的每个元素都存在于 arr2 中(考虑重复),则返回 True,否则返回 False

约束条件
  • 0 <= len(arr1) <= len(arr2) <= 10^5
  • -10^6 <= elements <= 10^6

示例

Example 1
Input
arr1 = [1, 2, 3], arr2 = [1, 2, 3, 4, 5]
Output
True
Explanation

All elements of arr1 (1, 2, 3) exist in arr2.

Example 2
Input
arr1 = [1, 2, 6], arr2 = [1, 2, 3, 4, 5]
Output
False
Explanation

6 is in arr1 but not in arr2.

Example 3
Input
arr1 = [], arr2 = [1, 2, 3]
Output
True
Explanation

An empty set is a subset of any set.

Need a Hint?
考虑使用特定于数组的数据结构,例如集合或堆。
Edge Cases to Watch
  • 空输入结构
  • 单元素输入
  • 大数值范围

准备好解决了吗?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

在编辑器中打开
Found this breakdown helpful?

PyRun is built and maintained by an independent solo developer. If this helped your interview prep, consider buying a coffee!

Buy me a coffee

推荐的 Python 资源

通过相关的交互式教程、备忘单和代码比较来扩展您的知识。