摘要:
https://leetcode cn.com/problems/as far from land as possible/submissions/ 动态规划 dp[i][j]表示前i,j的最小值 BFS 阅读全文
posted @ 2020-03-29 22:11
aaaaassss
阅读(209)
评论(0)
推荐(0)
摘要:
https://leetcode cn.com/problems/symmetric tree/submissions/ 用bfs层次遍历,队列实现 阅读全文
posted @ 2020-03-29 22:09
aaaaassss
阅读(78)
评论(0)
推荐(0)

浙公网安备 33010602011771号