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 資源

透過相關的互動式教學、備忘單和程式碼比較來擴展您的知識。