12 2021 档案

[LeetCode] 1277. Count Square Submatrices with All Ones 统计全为 1 的正方形子矩阵

摘要：Given a m * n matrix of ones and zeros, return how many square submatrices have all ones. Example 1: Input: matrix = [ [0,1,1,1], [1,1,1,1], [0,1,1,1] 阅读全文

posted @ 2021-12-26 14:03 Grandyang 阅读(727) 评论(0) 推荐(0) 编辑

[LeetCode] 1276. Number of Burgers with No Waste of Ingredients 不浪费原料的汉堡制作方案

摘要：Given two integers tomatoSlices and cheeseSlices. The ingredients of different burgers are as follows: Jumbo Burger: 4 tomato slices and 1 cheese slic 阅读全文

posted @ 2021-12-23 12:58 Grandyang 阅读(272) 评论(0) 推荐(0) 编辑

[LeetCode] 1275. Find Winner on a Tic Tac Toe Game 找出井字棋的获胜者

摘要：Tic-tac-toe is played by two players A and B on a 3 x 3 grid. The rules of Tic-Tac-Toe are: Players take turns placing characters into empty squares ' 阅读全文

posted @ 2021-12-19 13:09 Grandyang 阅读(722) 评论(0) 推荐(0) 编辑

[LeetCode] 1269. Number of Ways to Stay in the Same Place After Some Steps 停在原地的方案数

摘要：You have a pointer at index 0 in an array of size arrLen. At each step, you can move 1 position to the left, 1 position to the right in the array, or 阅读全文

posted @ 2021-12-17 16:35 Grandyang 阅读(425) 评论(0) 推荐(0) 编辑

[LeetCode] 1268. Search Suggestions System 搜索推荐系统

摘要：Given an array of strings products and a string searchWord. We want to design a system that suggests at most three product names from products after e 阅读全文

posted @ 2021-12-12 16:44 Grandyang 阅读(936) 评论(0) 推荐(0) 编辑

[LeetCode] 1266. Minimum Time Visiting All Points 访问所有点的最小时间

摘要：On a 2D plane, there are n points with integer coordinates points[i] = [xi, yi]. Return *the minimum time in seconds to visit all the points in the or 阅读全文

posted @ 2021-12-08 10:29 Grandyang 阅读(459) 评论(0) 推荐(0) 编辑

[LeetCode] 1263. Minimum Moves to Move a Box to Their Target Location 推箱子

摘要：A storekeeper is a game in which the player pushes boxes around in a warehouse trying to get them to target locations. The game is represented by an m 阅读全文

posted @ 2021-12-05 15:39 Grandyang 阅读(692) 评论(0) 推荐(0) 编辑

[LeetCode] 1262. Greatest Sum Divisible by Three 可被三整除的最大和

摘要：Given an array nums of integers, we need to find the maximum possible sum of elements of the array such that it is divisible by three. Example 1: Inpu 阅读全文

posted @ 2021-12-01 14:42 Grandyang 阅读(786) 评论(0) 推荐(0) 编辑