From 9d02c76777849bcf287cc3c11805fb8b98db8ce4 Mon Sep 17 00:00:00 2001
From: Guanzhong Pan <gpan20020205@gmail.com>
Date: Thu, 26 Jan 2023 17:24:38 +0000
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200063.=E4=B8=8D=E5=90=8C?=
 =?UTF-8?q?=E8=B7=AF=E5=BE=84II.md=20C=E8=AF=AD=E8=A8=80=E4=BC=98=E5=8C=96?=
 =?UTF-8?q?=E7=A9=BA=E9=97=B4=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0063.不同路径II.md | 33 +++++++++++++++++++++++++++++++++
 1 file changed, 33 insertions(+)

diff --git a/problems/0063.不同路径II.md b/problems/0063.不同路径II.md
index 9aa36956..b89486e6 100644
--- a/problems/0063.不同路径II.md
+++ b/problems/0063.不同路径II.md
@@ -539,6 +539,39 @@ int uniquePathsWithObstacles(int** obstacleGrid, int obstacleGridSize, int* obst
 }
 ```
 
+空间优化版本:
+```c
+int uniquePathsWithObstacles(int** obstacleGrid, int obstacleGridSize, int* obstacleGridColSize){
+    int m = obstacleGridSize; 
+    int n = obstacleGridColSize[0];
+    int *dp = (int*)malloc(sizeof(int) * n);
+    int i, j;
+
+    // 初始化dp为第一行起始状态。
+    for (j = 0; j < n; ++j) {
+        if (obstacleGrid[0][j] == 1)
+            dp[j] = 0;
+        else if (j == 0)
+            dp[j] = 1;
+        else
+            dp[j] = dp[j - 1];
+    }
+
+    for (i = 1; i < m; ++i) {
+        for (j = 0; j < n; ++j) {
+            if (obstacleGrid[i][j] == 1)
+                dp[j] = 0;
+            // 若j为0，dp[j]表示最左边一列，无需改动
+            // 此处dp[j],dp[j-1]等同于二维dp中的dp[i-1][j]和dp[i][j-1]
+            else if (j != 0)
+                dp[j] += dp[j - 1];
+        }
+    }
+
+    return dp[n - 1];
+}
+```
+
 ### Scala
 
 ```scala