A. Fingerprints 水题,暴力 #include<iostream>#include<algorithm>#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<cstdlib>#include<ctime>#include<set>#include<map>#includ
tag:图论 广度优先搜索 https://leetcode.cn/problems/rotting-oranges/description/?envType=study-plan-v2&envId=top-100-liked 使用广度优先搜索,搜索步数就是分钟数,等到所有橘子都腐烂后,各个橘子腐烂的最长分钟数就是全部都烂的最小分钟数 class Solution {public int
994 · Contiguous Array Algorithms The length of the given binary array will not exceed 50,000. Example Example 1: Input: [0,1] Output: 2 Explanation: [0, 1] is the longest contiguous subarray with