From 62cfba1210951f64a726567170705ecbf1866886 Mon Sep 17 00:00:00 2001
From: Shuxiao Wang <keaising@gmail.com>
Date: Fri, 19 Apr 2024 09:52:36 +0200
Subject: [PATCH] =?UTF-8?q?=E8=A7=A3=E5=86=B3=20`0063.=E4=B8=8D=E5=90=8C?=
 =?UTF-8?q?=E8=B7=AF=E5=BE=84II.md`=20=E7=A4=BA=E4=BE=8B=E4=BB=A3=E7=A0=81?=
 =?UTF-8?q?=E7=BC=A9=E8=BF=9B=E9=94=99=E8=AF=AF?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0063.不同路径II.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/problems/0063.不同路径II.md b/problems/0063.不同路径II.md
index 8c208ea8..2419b6a8 100644
--- a/problems/0063.不同路径II.md
+++ b/problems/0063.不同路径II.md
@@ -145,7 +145,7 @@ public:
     int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
         int m = obstacleGrid.size();
         int n = obstacleGrid[0].size();
-	if (obstacleGrid[m - 1][n - 1] == 1 || obstacleGrid[0][0] == 1) //如果在起点或终点出现了障碍，直接返回0
+        if (obstacleGrid[m - 1][n - 1] == 1 || obstacleGrid[0][0] == 1) //如果在起点或终点出现了障碍，直接返回0
             return 0;
         vector<vector<int>> dp(m, vector<int>(n, 0));
         for (int i = 0; i < m && obstacleGrid[i][0] == 0; i++) dp[i][0] = 1;