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.

---
 .../leetcode/cpp/li-wu-de-zui-da-jie-zhi-lcof.cpp  | 34 ----------------------
 1 file changed, 34 deletions(-)
 delete mode 100644 works/solutions/leetcode/cpp/li-wu-de-zui-da-jie-zhi-lcof.cpp

(limited to 'works/solutions/leetcode/cpp/li-wu-de-zui-da-jie-zhi-lcof.cpp')

diff --git a/works/solutions/leetcode/cpp/li-wu-de-zui-da-jie-zhi-lcof.cpp b/works/solutions/leetcode/cpp/li-wu-de-zui-da-jie-zhi-lcof.cpp
deleted file mode 100644
index dee81ec..0000000
--- a/works/solutions/leetcode/cpp/li-wu-de-zui-da-jie-zhi-lcof.cpp
+++ /dev/null
@@ -1,34 +0,0 @@
-#include <vector>
-
-using std::vector;
-
-#include <algorithm>
-
-class Solution
-{
-public:
-    int maxValue(vector<vector<int>> &grid)
-    {
-        int row_count = grid.size();
-        int col_count = grid.front().size();
-
-        for (int i = 1; i < row_count; i++)
-        {
-            grid[i][0] = grid[i - 1][0] + grid[i][0];
-        }
-
-        for (int j = 1; j < col_count; j++)
-        {
-            grid[0][j] = grid[0][j - 1] + grid[0][j];
-        }
-
-        for (int i = 1; i < row_count; i++)
-        {
-            for (int j = 1; j < col_count; j++)
-            {
-                grid[i][j] = std::max(grid[i - 1][j], grid[i][j - 1]) + grid[i][j];
-            }
-        }
-        return grid[row_count - 1][col_count - 1];
-    }
-};
-- 
cgit v1.2.3