LeetCode 单调栈内容小结
LeetCode Monotone Stack Summary 单调栈小结所谓的单调栈 Monotone Stack，就是栈内元素都是单调递增或者单调递减的，有时候需要严格的单调递增或递减，根据题目的具体情况来看吧。关于单调栈，这个帖子讲的不错，而且举了个排队的例子来类比。那么，博主也举个生动的例子来说明吧：比如有一天，某家店...
2022-01-16C++实现LeetCode(22.生成括号)
[LeetCode] 22. Generate Parentheses 生成括号Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:["((()))","(()())","(())()","()(())","()()()"]这道题给定一个数字n，让生成共有n个括号的所有...
2022-02-02C++实现LeetCode(202.快乐数)
[LeetCode] 202.Happy Number 快乐数Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat th...
2022-02-01C++实现LeetCode(120.三角形)
[LeetCode] 120.Triangle 三角形Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[[2],[3,4],[6,5,7],[4,1,8,3]]The minimum path sum from top to bo...
2022-02-02C++实现LeetCode(42.收集雨水)
[LeetCode] 42. Trapping Rain Water 收集雨水Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,...
2022-01-16C++实现LeetCode(20.验证括号)
[LeetCode] 20. Valid Parentheses 验证括号Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.An input string is valid if:Open brackets must be closed by the same type of brackets.Open brackets m...
2022-02-02C++实现LeetCode(207.课程清单)
[LeetCode] 207. Course Schedule 课程清单There are a total of n courses you have to take, labeled from 0 to n-1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair: [0,1]Given the total...
2022-02-01
C++实现LeetCode(62.不同的路径)
[LeetCode] 62. Unique Paths 不同的路径A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the ...
2022-02-02C++实现LeetCode(127.词语阶梯)
[LeetCode] 127.Word Ladder 词语阶梯Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord, such that:Only one letter can be changed at a time.Each transformed word mu...
2022-02-02C++实现LeetCode(206.倒置链表)
[LeetCode] 206.Reverse Linked List 倒置链表Reverse a singly linked list.Example:Input: 1->2->3->4->5->NULLOutput: 5->4->3->2->1->NULLFollow up:A linked list can be reversed either iteratively or recursively. Could you implement both? 之前做到 Reverse Linked List I...
2022-01-17C++实现LeetCode(92.倒置链表之二)
[LeetCode] 92. Reverse Linked List II 倒置链表之二Reverse a linked list from position m to n. Do it in one-pass.Note: 1 ≤ m ≤ n ≤ length of list.Example:Input: 1->2->3->4->5->NULL, m = 2, n = 4Output: 1->4->3->2->5->NULL很奇怪为何没有倒置链表之一，就来了这个倒置链表之二，不过猜也能猜得到之一就是单纯的倒...
2022-01-17SQL实现LeetCode(182.重复的邮箱)
[LeetCode] 182.Duplicate Emails 重复的邮箱Write a SQL query to find all duplicate emails in a table named Person.+----+---------+| Id | Email |+----+---------+| 1 | a@b.com || 2 | c@d.com || 3 | a@b.com |+----+---------+For example, your query should retur...
2021-12-21C++实现LeetCode(205.同构字符串)
[LeetCode] 205. Isomorphic Strings 同构字符串Given two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to get t.All occurrences of a character must be replaced with another character while pre...
2022-01-17C++实现LeetCode(200.岛屿的数量)
[LeetCode] 200. Number of Islands 岛屿的数量Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges o...
2022-02-02C++实现LeetCode(210.课程清单之二)
[LeetCode] 210. Course Schedule II 课程清单之二There are a total of n courses you have to take, labeled from 0 to n-1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair: [0,1]Given the ...
2022-02-01Pipes实现LeetCode(192.单词频率)
[LeetCode] 192.Word Frequency 单词频率Write a bash script to calculate the frequency of each word in a text file words.txt.For simplicity sake, you may assume:words.txt contains only lowercase characters and space ' ' characters.Each word must consist of lower...
2022-02-01C++实现LeetCode(21.混合插入有序链表)
[LeetCode] 21. Merge Two Sorted Lists 混合插入有序链表Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.Example:Input: 1->2->4, 1->3->4Output: 1->1->2->3->4->4这道混合插入有序链表和我之前...
2022-02-02【leetcode】221. 最大正方形 动态规划法
在一个由 0 和 1 组成的二维矩阵内，找到只包含 1 的最大正方形，并返回其面积。示例:输入:1 0 1 0 01 0 1 1 11 1 1 1 11 0 0 1 0输出: 4动态规划法分析：我们用 dp(i,j)dp(i, j)dp(i,j) 表示以 (i,j)(i, j)(i,j) 为右下角，且只包含 111 的正方形的边长最大值。如果我们能计算出所有 dp(i,j)dp(i, j)dp(i,j) 的值，那么其中...
2020-08-08C++实现LeetCode(128.求最长连续序列)
[LeetCode] 128.Longest Consecutive Sequence 求最长连续序列Given an unsorted array of integers, find the length of the longest consecutive elements sequence.Your algorithm should run in O(n) complexity.Example:Input: [100, 4, 200, 1, 3, 2]Output: 4Explanation: The...
2022-02-02C++实现LeetCode(201.数字范围位相与)
[LeetCode] 201.Bitwise AND of Numbers Range 数字范围位相与Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive.For example, given the range [5, 7], you should return 4.Credits:Special thanks to @amrs...
2022-02-01C++实现LeetCode(125.验证回文字符串)
[LeetCode] 125.Valid Palindrome 验证回文字符串Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Panama" is a palindrome."race a car" is not a palindrome.Note:Have you ...
2022-01-17C++实现LeetCode(102.二叉树层序遍历)
[LeetCode] 102. Binary Tree Level Order Traversal 二叉树层序遍历Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#,#,15,7}, 3/ \9 20/ \15 7return its ...
2022-02-02C++实现LeetCode(86.划分链表)
[LeetCode] 86.Partition List 划分链表Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in each of the two partitions.For exa...
2022-02-02
C++实现LeetCode(61.旋转链表)
[LeetCode] 61. Rotate List 旋转链表Given the head of a linked list, rotate the list to the right by k places.Example 1:Input: head = [1,2,3,4,5], k = 2Output: [4,5,1,2,3]Example 2:Input: head = [0,1,2], k = 4Output: [2,0,1]Constraints:The number of nodes in th...
2022-02-02C++实现LeetCode(85.最大矩形)
[LeetCode] 85. Maximal Rectangle 最大矩形Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area.Example:Input:[["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]...
2022-02-02
