xinyu04

导航

2022年5月12日 #

LeetCode 198. House Robber DP

摘要: You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo 阅读全文

posted @ 2022-05-12 17:30 Blackzxy 阅读(16) 评论(0) 推荐(0) 编辑

LeetCode 221 Maximal Square DP

摘要: Given an m x n binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area. Solution 设 \(dp[i][j]\) 表示能到达位置 阅读全文

posted @ 2022-05-12 04:18 Blackzxy 阅读(21) 评论(0) 推荐(0) 编辑