sun%moon

文章目录解题代码解题思路英文题目链接中文题目链接You are given a 0-indexed 2D integer array grid of size m x n. Each cell has one of two values:0 represents an empty cell,1 represents an obstacle that may be removed.You can move up, down, left, or right from and to an empty

文章目录背景小窍门LeftBigger例子代码LeftSmaller例子代码RightBigger例子代码RightSmaller例子代码测试LeetCode题目背景我们经常会遇到这种类型的问题：给定一个数组，针对数组中每个元素，找出其左边第一个比它大的数(LeftBigger)；给定一个数组，针对数组中每个元素，找出其左边第一个比它小的数(LeftSmaller)；给定一个数组，针对数组中每个元素，找出其右边第一个比它大的数(RightBigger)；给定一个数组，针对数组中每个元素，找出其

文章目录329. Longest Increasing Path in a Matrix解题代码解题思路329. Longest Increasing Path in a Matrix英文题目链接中文题目链接Given an m x n integers matrix, return the length of the longest increasing path in matrix.From each cell, you can either move in four directions:

题目链接英文题目中文题目题目There is a room with n lights which are turned on initially and 4 buttons on the wall. After performing exactly m unknown operations towards buttons, you need to return how many different kinds of status of the n lights could be.Suppose

题目描述英文题目中文题目题目There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it's off or turning off if it's on). For the i-th round, you t

题目英文题目链接中文题目链接描述Given an array nums of integers, you can perform operations on the array.In each operation, you pick any nums[i] and delete it to earn nums[i] points. After, you must delete every element equal to nums[i] - 1 or nums[i] + 1.You start

题目传送门英文题目地址中文题目地址题目描述Given an array of scores that are non-negative integers. Player 1 picks one of the numbers from either end of the array followed by the player 2 and then player 1 and so on. Each time a player picks a number, that number will not b

题目链接：Ones and Zeroes英文题目In the computer world, use restricted resource you have to generate maximum benefit is what we always want to pursue.For now, suppose you are a dominator of m 0s and n 1s...

数组旋转(数字无重复):153. Find Minimum in Rotated Sorted Array能用二分法特点：数组有一个不可导的最小值，最小值两边的数字都是有序的数组旋转(数字有重复)：154. Find Minimum in Rotated Sorted Array II不能用二分法未完待续…...