From d8f3b40085619cb680c8f227c65a1f5acc393223 Mon Sep 17 00:00:00 2001
From: crupest <crupest@outlook.com>
Date: Tue, 23 Feb 2021 21:07:19 +0800
Subject: Move leetcode solutions to subdir.

---
 leetcode/cpp/li-wu-de-zui-da-jie-zhi-lcof.cpp | 34 +++++++++++++++++++++++++++
 1 file changed, 34 insertions(+)
 create mode 100644 leetcode/cpp/li-wu-de-zui-da-jie-zhi-lcof.cpp

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

diff --git a/leetcode/cpp/li-wu-de-zui-da-jie-zhi-lcof.cpp b/leetcode/cpp/li-wu-de-zui-da-jie-zhi-lcof.cpp
new file mode 100644
index 0000000..dee81ec
--- /dev/null
+++ b/leetcode/cpp/li-wu-de-zui-da-jie-zhi-lcof.cpp
@@ -0,0 +1,34 @@
+#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