coding interviews 047 solved.

Author: liuyubobobo

Coding-Interviews/047/cpp-047/CMakeLists.txt

@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.24)
+project(cpp_047)
+
+set(CMAKE_CXX_STANDARD 17)
+
+add_executable(cpp_047 main.cpp)

Coding-Interviews/047/cpp-047/main.cpp

@@ -0,0 +1,32 @@
+/// Source : https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof/
+/// Author : liuyubobobo
+/// Time   : 2023-03-07
+
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+
+/// DP
+/// Time Complexity: O(R * C)
+/// Space Complexity: O(R * C)
+class Solution {
+public:
+    int maxValue(vector<vector<int>>& grid) {
+
+        int R = grid.size(), C = grid[0].size();
+
+        vector<vector<int>> dp(R + 1, vector<int>(C + 1, 0));
+        for(int i = 0; i < R; i ++)
+            for(int j = 0; j < C; j ++)
+                dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]) + grid[i][j];
+        return dp[R][C];
+    }
+};
+
+
+int main() {
+
+    return 0;
+}