Feature/chapter dynamic programming swift (#608)

* feat: add Swift codes for intro_to_dynamic_programming article * feat: add Swift codes for dp_problem_features article * feat: add Swift codes for dp_solution_pipeline article * feat: add Swift codes for knapsack_problem article * feat: add Swift codes for unbounded_knapsack_problem article * feat: add Swift codes for edit_distance_problem article
2026-08-25 09:37:14 +00:00 · 2023-07-18 12:49:03 +08:00
parent 34985bdf2b
commit 9ea8a73059
13 changed files with 855 additions and 0 deletions
@@ -0,0 +1,36 @@
+/**
+ * File: climbing_stairs_constraint_dp.swift
+ * Created Time: 2023-07-15
+ * Author: nuomi1 (nuomi1@qq.com)
+ */
+
+/* 带约束爬楼梯：动态规划 */
+func climbingStairsConstraintDP(n: Int) -> Int {
+    if n == 1 || n == 2 {
+        return n
+    }
+    // 初始化 dp 表，用于存储子问题的解
+    var dp = Array(repeating: Array(repeating: 0, count: 3), count: n + 1)
+    // 初始状态：预设最小子问题的解
+    dp[1][1] = 1
+    dp[1][2] = 0
+    dp[2][1] = 0
+    dp[2][2] = 1
+    // 状态转移：从较小子问题逐步求解较大子问题
+    for i in stride(from: 3, through: n, by: 1) {
+        dp[i][1] = dp[i - 1][2]
+        dp[i][2] = dp[i - 2][1] + dp[i - 2][2]
+    }
+    return dp[n][1] + dp[n][2]
+}
+
+@main
+enum ClimbingStairsConstraintDP {
+    /* Driver Code */
+    static func main() {
+        let n = 9
+
+        let res = climbingStairsConstraintDP(n: n)
+        print("爬 \(n) 阶楼梯共有 \(res) 种方案")
+    }
+}