Leetcode
文章平均质量分 54
Heisenberg_888
互联网工程师,努力学习中
展开
-
1143. 最长公共子序列
是指这样一个新的字符串:它是由原字符串在不改变字符的相对顺序的情况下删除某些字符(也可以不删除任何字符)后组成的新字符串。最长公共子序列是 "ace" ,它的长度为 3。最长公共子序列是 "abc" ,它的长度为 3。两个字符串没有公共子序列,返回 0。是这两个字符串所共同拥有的子序列。,返回这两个字符串的最长。原创 2024-09-19 22:29:22 · 282 阅读 · 0 评论 -
5. 最长回文子串
"aba" 同样是符合题意的答案。中最长的 回文子串。原创 2024-09-12 22:01:17 · 406 阅读 · 0 评论 -
64. 最小路径和
请找出一条从左上角到右下角的路径,使得路径上的数字总和为最小。因为路径 1→3→1→1→1 的总和最小。每次只能向下或者向右移动一步。给定一个包含非负整数的。原创 2024-09-09 22:15:15 · 328 阅读 · 0 评论 -
LeetCode hot100刷题记录
LeetCode刷题记录 (yuque.com)原创 2024-09-04 09:04:31 · 173 阅读 · 0 评论 -
279. 完全平方数
是一个整数,其值等于另一个整数的平方;换句话说,其值等于一个整数自乘的积。的完全平方数的最少数量。原创 2024-08-29 21:21:01 · 183 阅读 · 1 评论 -
763. 划分字母区间
【代码】763. 划分字母区间。原创 2024-08-25 13:04:01 · 167 阅读 · 0 评论 -
121. Best Time to Buy and Sell Stock
Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.Note t...原创 2020-11-04 21:06:07 · 120 阅读 · 0 评论 -
295. 数据流的中位数
/ 返回 1.5 ((1 + 2) / 2)是有序整数列表中的中间值。如果列表的大小是偶数,则没有中间值,中位数是两个中间值的平均值。返回到目前为止所有元素的中位数。以内的答案将被接受。原创 2024-08-23 23:23:27 · 443 阅读 · 0 评论 -
394. 字符串解码
你可以认为输入字符串总是有效的;输入字符串中没有额外的空格,且输入的方括号总是符合格式要求的。此外,你可以认为原始数据不包含数字,所有的数字只表示重复的次数。给定一个经过编码的字符串,返回它解码后的字符串。,表示其中方括号内部的。原创 2024-08-16 20:11:27 · 325 阅读 · 0 评论 -
208. 实现 Trie (前缀树)
是一种树形数据结构,用于高效地存储和检索字符串数据集中的键。这一数据结构有相当多的应用情景,例如自动补完和拼写检查。// 返回 False。// 返回 True。// 返回 True。// 返回 True。(发音类似 "try")或者说。原创 2024-08-02 19:41:20 · 355 阅读 · 0 评论 -
400. Nth Digit
Given an integern, return thenthdigit of the infinite integer sequence[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ...].Example 1:Input: n = 3Output: 3Example 2:Input: n = 11Output: 0Explanation: The 11th digit of the sequence 1, 2, 3, 4, 5, 6,...原创 2021-03-28 22:05:02 · 83 阅读 · 0 评论 -
134. Gas Station
There arengas stations along a circular route, where the amount of gas at theithstation isgas[i].You have a car with an unlimited gas tank and it costscost[i]of gas to travel from theithstation to its next(i + 1)thstation. You begin the journe...原创 2021-03-27 16:40:23 · 160 阅读 · 0 评论 -
354. Russian Doll Envelopes俄罗斯套娃信封dp
You are given a 2D array of integersenvelopeswhereenvelopes[i] = [wi, hi]represents the width and the height of an envelope.One envelope can fit into another if and only if both the width and height of one envelope is greater than the width and heigh...原创 2021-03-23 21:31:35 · 180 阅读 · 0 评论 -
403. Frog Jump
A frog is crossing a river. The river is divided into some number of units, and at each unit, there may or may not exist a stone. The frog can jump on a stone, but it must not jump into the water.Given a list ofstones' positions (in units) in sortedasc..原创 2021-03-22 21:58:57 · 127 阅读 · 0 评论 -
329. Longest Increasing Path in a Matrix dfs+记忆化搜索
https://leetcode.com/problems/longest-increasing-path-in-a-matrix/原创 2021-03-21 22:53:15 · 159 阅读 · 0 评论 -
72. Edit Distance
Given two stringsword1andword2, returnthe minimum number of operations required to convertword1toword2.You have the following three operations permitted on a word:Insert a character Delete a character Replace a characterExample 1:Input:...原创 2021-03-20 16:28:54 · 181 阅读 · 0 评论 -
322. Coin Change 01-背包、完全背包、多重背包及其相关应用
You are given coins of different denominations and a total amount of moneyamount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, retur.原创 2020-11-11 22:53:33 · 198 阅读 · 0 评论 -
115. Distinct Subsequences
Given two stringssandt, returnthe number of distinct subsequences ofswhich equalst.A string'ssubsequenceis a new string formed from the original string by deleting some (can be none) of the characters without disturbing the remaining characters'...原创 2021-03-20 14:23:47 · 265 阅读 · 0 评论 -
221. Maximal Square
Given anm x nbinarymatrixfilled with0's and1's,find the largest square containing only1'sand return its area.Example 1:Input: matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]Output: 4...原创 2021-03-20 09:55:30 · 192 阅读 · 0 评论 -
300. Longest Increasing Subsequence最长上升子序列lower_bound()upper_bound()
Given an integer arraynums, return the length of the longest strictly increasing subsequence.Asubsequenceis a sequence that can be derived from an array by deleting some or no elements without changing the order of the remaining elements. For example,...原创 2021-01-27 10:14:10 · 307 阅读 · 0 评论 -
91. Decode Ways
A message containing letters fromA-Zcan beencodedinto numbers using the following mapping:'A' -> "1"'B' -> "2"...'Z' -> "26"Todecodean encoded message, all the digits must be grouped then mapped back into letters using the reverse o...原创 2021-03-19 11:10:13 · 185 阅读 · 0 评论 -
980. Unique Paths III
980.Unique Paths IIIHard133288Add to ListShareOn a 2-dimensionalgrid, there are 4 types of squares:1represents the starting square. There is exactly one starting square. 2represents the ending square. There is exactly one ending square. 0r...原创 2021-03-15 16:35:35 · 148 阅读 · 0 评论 -
450. Delete Node in a BST二叉搜索树删除一个节点(巧妙的递归)
Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of the BST.Basically, the deletion can be divided into two stages:Search for a node to remove. If the node原创 2021-03-14 15:50:21 · 357 阅读 · 0 评论 -
230. Kth Smallest Element in a BST二叉搜索树的第k小节点
Given therootof a binary search tree, and an integerk, returnthekth(1-indexed)smallest element in the tree.Example 1:Input: root = [3,1,4,null,2], k = 1Output: 1Example 2:Input: root = [5,3,6,2,4,null,null,1], k = 3Output: 3...原创 2021-03-14 15:37:13 · 139 阅读 · 0 评论 -
226. Invert Binary Tree二叉树镜像
Invert a binary tree.Example:Input: 4 / \ 2 7 / \ / \1 3 6 9Output: 4 / \ 7 2 / \ / \9 6 3 1题目链接:https://leetcode.com/problems/invert-binary-tree//** * Definition for a binary tree node. *.原创 2021-03-14 15:30:34 · 166 阅读 · 0 评论 -
1584. Min Cost to Connect All Points最小生成树时间复杂度对比
You are given an arraypointsrepresenting integer coordinates of some points on a 2D-plane, wherepoints[i] = [xi, yi].The cost of connecting two points[xi, yi]and[xj, yj]is themanhattan distancebetween them:|xi- xj| + |yi- yj|, where|val|den...原创 2021-03-13 13:33:15 · 179 阅读 · 0 评论 -
494. Target Sum
You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols+and-. For each integer, you should choose one from+and-as its new symbol.Find out how many ways to assign symbols to make sum of integers equal...原创 2021-03-12 17:10:43 · 100 阅读 · 0 评论 -
437. Path Sum III
You are given a binary tree in which each node contains an integer value.Find the number of paths that sum to a given value.The path does not need to start or end at the root or a leaf, but it must go downwards (traveling only from parent nodes to chil原创 2021-03-12 16:27:06 · 101 阅读 · 0 评论 -
257. Binary Tree Paths找出所有的路径
Given a binary tree, return all root-to-leaf paths.Note:A leaf is a node with no children.Example:Input: 1 / \2 3 \ 5Output: ["1->2->5", "1->3"]Explanation: All root-to-leaf paths are: 1->2->5, 1->3题目链接:https:.原创 2021-03-12 15:29:33 · 115 阅读 · 0 评论 -
236. Lowest Common Ancestor of a Binary Tree最小祖先节点
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to thedefinition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodespandqas the lowest node inTthat has bothpandqas d...原创 2021-03-12 12:30:00 · 92 阅读 · 0 评论 -
815. Bus Routes坐公交车
题目链接:https://leetcode.com/problems/bus-routes/原创 2021-03-09 10:14:34 · 270 阅读 · 0 评论 -
1411. Number of Ways to Paint N × 3 Grid给格子涂色
题目链接:https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid/原创 2021-03-09 10:13:27 · 310 阅读 · 0 评论 -
84. Largest Rectangle in Histogram直方图单调栈
https://leetcode.com/problems/largest-rectangle-in-histogram/原创 2021-03-05 17:40:26 · 169 阅读 · 0 评论 -
225. Implement Stack using Queues
Implement a last in first out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal queue (push,top,pop, andempty).Implement theMyStackclass:void push(int x)Pushes element x to the top of the stack...原创 2021-03-05 14:33:51 · 204 阅读 · 0 评论 -
232. Implement Queue using Stacks用2个栈实现一个队列queue
Implement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue (push,peek,pop, andempty).Implement theMyQueueclass:void push(int x)Pushes element x to the back of the qu...原创 2021-03-05 14:06:18 · 417 阅读 · 0 评论 -
328. Odd Even Linked List
Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.You should try to do it in place. The program should run in O(1) space complexity an原创 2021-02-28 10:00:43 · 79 阅读 · 0 评论 -
470. Implement Rand10() Using Rand7()
Given theAPIrand7()that generates a uniform random integer in the range[1, 7], write a functionrand10()that generates a uniform random integer in the range[1, 10]. You can only call the APIrand7(), and you shouldn't call any other API. Pleasedo no...原创 2021-02-27 18:13:19 · 223 阅读 · 0 评论 -
128. Longest Consecutive Sequence最长连续序列
Given an unsorted array of integersnums, returnthe length of the longest consecutive elements sequence.Example 1:Input: nums = [100,4,200,1,3,2]Output: 4Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length i..原创 2021-02-26 18:08:02 · 166 阅读 · 0 评论 -
239. Sliding Window Maximum 滑动窗口最大值deque双端队列使用
You are given an array of integersnums, there is a sliding window of sizekwhich is moving from the very left of the array to the very right. You can only see theknumbers in the window. Each time the sliding window moves right by one position.Return...原创 2021-02-26 12:00:12 · 207 阅读 · 0 评论 -
260. Single Number III
Given an integer arraynums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once. You can return the answer inany order.Follow up:Your algorithm should run in linea...原创 2021-02-26 11:14:10 · 88 阅读 · 0 评论