150強訪談簡單

排列

“排列”問題的詳細指南和 Python 實作。

問題陳述

簡單

給定一個由不同整數組成的陣列 nums,傳回所有可能的排列。您可以按任意順序返回答案。

實作函數 permute(nums: list) -> list

約束條件
  • 1 <= nums.length <= 6
  • -10 <= nums[i] <= 10
  • All the integers of nums are unique

範例

Example 1
Input
[1,2,3]
Output
[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
Explanation

All 3! = 6 permutations of [1,2,3] are generated.

Example 2
Input
[0,1]
Output
[[0,1],[1,0]]
Explanation

All 2! = 2 permutations of [0,1] are generated.

Example 3
Input
[1]
Output
[[1]]
Explanation

Only one permutation exists for a single element.

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

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