競賽程式設計簡單

最長公共序列

“最長公共序列”問題的詳細指南和 Python 實作。

問題陳述

簡單

寫一個函數 lcs(s1, s2),傳回兩個字串 s1s2 的最長公共子序列的長度。

約束條件
  • 0 <= len(s1), len(s2) <= 1000
  • Strings consist of uppercase English letters.

範例

Example 1
Input
lcs('ABCDGH', 'AEDFHR')
Output
3
Explanation

The longest common subsequence is 'ADH' which has length 3.

Example 2
Input
lcs('AGGTAB', 'GXTXAYB')
Output
4
Explanation

The longest common subsequence is 'GTAB' which has length 4.

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

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