摘要：
Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2. You have the following three operations 阅读全文
posted @ 2022-11-13 18:08
MarkLeeBYR
阅读(22)
评论(0)
推荐(0)
摘要：
剑指offer 跳台阶 https://www.cnblogs.com/MarkLeeBYR/p/9777214.html 阅读全文
posted @ 2022-11-13 16:00
MarkLeeBYR
阅读(8)
评论(0)
推荐(0)
摘要：
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. 阅读全文
posted @ 2022-11-13 15:41
MarkLeeBYR
阅读(27)
评论(0)
推荐(0)
摘要：
There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-rig 阅读全文
posted @ 2022-11-13 15:29
MarkLeeBYR
阅读(20)
评论(0)
推荐(0)
摘要：
Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals 阅读全文
posted @ 2022-11-12 23:10
MarkLeeBYR
阅读(28)
评论(0)
推荐(0)
摘要：
剑指offer 顺时针打印矩阵 https://www.cnblogs.com/MarkLeeBYR/p/9776471.html 阅读全文
posted @ 2022-11-12 23:08
MarkLeeBYR
阅读(14)
评论(0)
推荐(0)
摘要：
看剑指offer 连续子数组的最大和 https://www.cnblogs.com/MarkLeeBYR/p/9774387.html 阅读全文
posted @ 2022-11-12 23:07
MarkLeeBYR
阅读(13)
评论(0)
推荐(0)
摘要：
The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other. Given an integer n, return al 阅读全文
posted @ 2022-11-12 23:06
MarkLeeBYR
阅读(32)
评论(0)
推荐(0)
摘要：
Given an array of strings, group anagrams together. For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return: [ ["ate", "eat","tea"], [" 阅读全文
posted @ 2022-11-12 22:01
MarkLeeBYR
阅读(17)
评论(0)
推荐(0)
摘要：
You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise). You have to rotate the image in-place, which means 阅读全文
posted @ 2022-11-07 11:08
MarkLeeBYR
阅读(29)
评论(0)
推荐(0)
浙公网安备 33010602011771号