競賽程式設計簡單

棒材切割

“棒切割”問題的詳細指南和 Python 實作。

問題陳述

簡單

寫一個函數 cut_rod(price, n),它接受價格列表 price,其中 price[i] 是長度為 i+1 且總長度為 n 的桿的價格。返回切割長度為 n 的桿並出售碎片可獲得的最大值。

約束條件
  • 1 <= n <= 1000
  • len(price) >= n
  • 1 <= price[i] <= 10000

範例

Example 1
Input
cut_rod([1, 5, 8, 9, 10, 17, 17, 20], 8)
Output
22
Explanation

Cut the rod of length 8 into two pieces of length 2 and 6. The total value is 5 + 17 = 22.

Example 2
Input
cut_rod([3, 5, 8, 9, 10, 17, 17, 20], 8)
Output
24
Explanation

Cut the rod of length 8 into eight pieces of length 1. The total value is 8 * 3 = 24.

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

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