xinyu04

导航

2022年7月23日 #

LeetCode 78 Subsets 回溯

摘要: Given an integer array nums of unique elements, return all possible subsets (the power set). The solution set must not contain duplicate subsets. Retu 阅读全文

posted @ 2022-07-23 21:07 Blackzxy 阅读(13) 评论(0) 推荐(0) 编辑

LeetCode 994 Rotting Oranges BFS

摘要: You are given an m x n grid where each cell can have one of three values: 0 representing an empty cell, 1 representing a fresh orange, or 2 representi 阅读全文

posted @ 2022-07-23 16:31 Blackzxy 阅读(13) 评论(0) 推荐(0) 编辑

LeetCode 542 01 Matrix BFS

摘要: Given an m x n binary matrix mat, return the distance of the nearest 0 for each cell. The distance between two adjacent cells is $1$ Solution 首先将所有的 $ 阅读全文

posted @ 2022-07-23 15:17 Blackzxy 阅读(9) 评论(0) 推荐(0) 编辑

Codeforces Round #805 (Div. 3) A C D E F题解

摘要: A. problem A 点击查看代码 #include<iostream> #include<cstdio> #include<algorithm> #include<cstdlib> #include<cstring> #include<string> #include<cmath> #incl 阅读全文

posted @ 2022-07-23 05:54 Blackzxy 阅读(33) 评论(0) 推荐(0) 编辑