![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划
stevexiaofei
这个作者很懒,什么都没留下…
展开
-
损失最小的路径
nt get_min_cost_path(vector<vector<int>>& mat) { int rows = mat.size(); int cols = mat[0].size(); vector<int> dp(rows); vector<int> dp_(rows); for (int i = 0; i < rows; i++) dp[i] = mat[i][0]; for (int c_idx = 1; c_id原创 2021-08-16 22:48:20 · 95 阅读 · 0 评论 -
打家劫舍——四联
标准打架劫色 class Solution { public: int rob(vector<int>& nums) { if (nums.size() == 0) return 0; if (nums.size() == 1) return nums[0]; int first = nums[0]; int second = max(nums[1], nums[0])原创 2021-07-16 01:01:16 · 83 阅读 · 0 评论