From dc1f0c4c0096013799416664894c5194dc7e1f52 Mon Sep 17 00:00:00 2001
From: Yuqian Yang <crupest@crupest.life>
Date: Fri, 28 Feb 2025 23:13:39 +0800
Subject: chore(store): move everything to store.

---
 works/solutions/leetcode/cpp/63.cpp | 44 -------------------------------------
 1 file changed, 44 deletions(-)
 delete mode 100644 works/solutions/leetcode/cpp/63.cpp

(limited to 'works/solutions/leetcode/cpp/63.cpp')

diff --git a/works/solutions/leetcode/cpp/63.cpp b/works/solutions/leetcode/cpp/63.cpp
deleted file mode 100644
index ed07bdc..0000000
--- a/works/solutions/leetcode/cpp/63.cpp
+++ /dev/null
@@ -1,44 +0,0 @@
-#include <vector>
-
-using std::vector;
-
-class Solution
-{
-public:
-    int uniquePathsWithObstacles(vector<vector<int>> &obstacleGrid)
-    {
-        if (obstacleGrid[0][0])
-            return 0;
-        obstacleGrid[0][0] = 1;
-
-        int row = obstacleGrid.size();
-        int col = obstacleGrid.front().size();
-
-        for (int i = 1; i < row; i++)
-        {
-            obstacleGrid[i][0] = obstacleGrid[i - 1][0] && !obstacleGrid[i][0] ? 1 : 0;
-        }
-
-        for (int i = 1; i < col; i++)
-        {
-            obstacleGrid[0][i] = obstacleGrid[0][i - 1] && !obstacleGrid[0][i] ? 1 : 0;
-        }
-
-        for (int r = 1; r < row; r++)
-        {
-            for (int c = 1; c < col; c++)
-            {
-                if (obstacleGrid[r][c])
-                {
-                    obstacleGrid[r][c] = 0;
-                }
-                else
-                {
-                    obstacleGrid[r][c] = obstacleGrid[r - 1][c] + obstacleGrid[r][c - 1];
-                }
-            }
-        }
-
-        return obstacleGrid[row - 1][col - 1];
-    }
-};
-- 
cgit v1.2.3