From 821cca116c6d42020ddac3bbb68c632eba7de132 Mon Sep 17 00:00:00 2001
From: BaoTaoqi <464115280@qq.com>
Date: Fri, 8 Jul 2022 15:11:49 +0800
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=20Rust=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

添加 0063.不同路径II.md Rust版本
---
 problems/0063.不同路径II.md | 36 +++++++++++++++++++++++++++++++++
 1 file changed, 36 insertions(+)

diff --git a/problems/0063.不同路径II.md b/problems/0063.不同路径II.md
index ca34055a..e3857db6 100644
--- a/problems/0063.不同路径II.md
+++ b/problems/0063.不同路径II.md
@@ -384,6 +384,42 @@ function uniquePathsWithObstacles(obstacleGrid: number[][]): number {
 };
 ```
 
+### Rust
+
+```Rust
+impl Solution {
+    pub fn unique_paths_with_obstacles(obstacle_grid: Vec<Vec<i32>>) -> i32 {
+        let m: usize = obstacle_grid.len();
+        let n: usize = obstacle_grid[0].len();
+        if obstacle_grid[0][0] == 1 || obstacle_grid[m-1][n-1] == 1 {
+            return 0;
+        }
+        let mut dp = vec![vec![0; n]; m];
+        for i in 0..m {
+            if obstacle_grid[i][0] == 1 {
+                break;
+            }
+            else { dp[i][0] = 1; }
+        }
+        for j in 0..n {
+            if obstacle_grid[0][j] == 1 {
+                break;
+            }
+            else { dp[0][j] = 1; }
+        }
+        for i in 1..m {
+            for j in 1..n {
+                if obstacle_grid[i][j] == 1 {
+                    continue;
+                }
+                dp[i][j] = dp[i-1][j] + dp[i][j-1];
+            }
+        }
+        dp[m-1][n-1]
+    }
+}
+```
+
 ### C
 
 ```c