red_tongue的博客

993.Cousins in Binary Tree（二叉树的堂兄弟节点 ）DescriptionDifficulty: easyExample 1:Example 2:Example 3:Note:分析参考代码 Description In a binary tree, the root node is at depth 0, and children of each depth k node ...

994.Rotting Oranges（腐烂的橘子 ）DescriptionDifficulty: easyExample 1:Example 2:Example 3:Note:分析参考代码 Description In a given grid, each cell can have one of three values: the value 0 representing an empty...

@[TOC](995.Minimum Number of K Consecutive Bit Flips(K 连续位的最小翻转次数 )) Description In an array A containing only 0s and 1s, a K-bit flip consists of choosing a (contiguous) subarray of length K and simu...

996.Number of Sequareful Arrays（正方形数组的数目）DescriptionDifficulty: hardExample 1:Example 2:Note:分析参考代码 Description Given an array A of non-negative integers, the array is squareful if for every pair of a...