150強訪談簡單

兩和

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

問題陳述

簡單

給定一個整數陣列 nums 和一個整數 target,傳回兩個數字的索引,使它們相加為 target

您可以假設每個輸入都有一個解決方案,並且您不能兩次使用相同的元素。

您可以按任意順序返回答案。

寫一個函數 twoSum(nums: List[int], target: int) -> List[int]

約束條件
  • 2 <= len(nums) <= 10^4
  • -10^9 <= nums[i] <= 10^9
  • -10^9 <= target <= 10^9
  • Only one valid answer exists

範例

Example 1
Input
nums = [2, 7, 11, 15], target = 9
Output
[0, 1]
Explanation

nums[0] + nums[1] = 2 + 7 = 9, so we return [0, 1].

Example 2
Input
nums = [3, 2, 4], target = 6
Output
[1, 2]
Explanation

nums[1] + nums[2] = 2 + 4 = 6, so we return [1, 2].

Example 3
Input
nums = [3, 3], target = 6
Output
[0, 1]
Explanation

nums[0] + nums[1] = 3 + 3 = 6, so we return [0, 1].

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

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