雨水leetcode 015 42
leetcode刷题日记
unordered_set散列哈希表：[C++ STL unordered_set容器完全攻略 (biancheng.net)](http://c.biancheng.net/view/7250.html) unordered_map：[详细介绍C++STL：unordered_map - 朤尧 - ......
Leetcode 160. 链表相交(Intersection of two linked lists lcci)
[题目链接](https://leetcode.cn/problems/intersection-of-two-linked-lists-lcci/description) 给定两个单链表的头节点headA和headB, 请找出并返回两个单链表相交的起始节点. 如果两个链表没有交点, 返回null. ......
Leetcode 1388. 3n 块披萨
（本文只提供了解题思路的思考，[原文作者题解连接](https://leetcode.cn/problems/pizza-with-3n-slices/solutions/527304/dpjie-fa-yu-da-jia-jie-she-2-de-chai-bie-ihso/)) 先把题目粘贴在这 ......
leetcode1372dp求交错路径长
bfd+dp unordered_map<TreeNode* ,int>d,p; queue<pair<TreeNode* ,TreeNode*>>q; int dp(TreeNode* root){ d[root]=p[root]=0; q.push({root,nullptr}); while( ......
[LeetCode][70]climbing-stairs
# Content You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can ......
[LeetCode][42]trapping-rain-water
# Content Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raini ......
[LeetCode][53]maximum-subarray
# Content Given an integer array nums, find the subarray with the largest sum, and return its sum. Example 1: Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Ou ......
[LeetCode][55]jump-game
# Content You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your ......
[LeetCode][62]unique-paths
# Content 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 ......
[LeetCode][10]regular-expression-matching
# Content Given an input string s and a pattern p, implement regular expression matching with support for '.' and '*' where: '.' Matches any single ch ......
[LeetCode][32]longest-valid-parentheses
# Content Given a string containing just the characters '(' and ')', return the length of the longest valid (well-formed) parentheses substring. Examp ......
[LeetCode][64]minimum-path-sum
# Content 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 ......
LeetCode[42]TrappingRainWater
# Content Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raini ......
LeetCode[10]RegularExpressionMatching
# Content Given an input string s and a pattern p, implement regular expression matching with support for '.' and '*' where: '.' Matches any single ch ......
LeetCode[32]LongestValidParentheses
# Content Given a string containing just the characters '(' and ')', return the length of the longest valid (well-formed) parentheses substring. Examp ......
LeetCode[53]MaximumSubarray
# Content Given an integer array nums, find the subarray with the largest sum, and return its sum. Example 1: Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Ou ......
LeetCode[62]UniquePaths
# Content 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 ......
LeetCode[55]JumpGame
# Content You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your ......
LeetCode[64]MinimumPathSum
# Content 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 ......
【LeetCode1270. 向公司CEO汇报工作的所有人】with recursive找到某节点所有的后代
# 题目地址 https://leetcode.cn/problems/all-people-report-to-the-given-manager/description/ # 代码 ``` WITH RECURSIVE cte_subordinates AS ( -- 基础情况: 找到直接下属 ......
【leetcode】1.two sum
第一题给我干懵了...想达到这个要求把我脑壳都想痛了...Follow-up: Can you come up with an algorithm that is less than O(n2) time complexity? 一开始想过用map，但是不能解决重复key的问题。 然而我用sort， ......
No_42_TrappingRainWater
# Content Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raini ......
[42]Trapping Rain Water
# Content Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raini ......
LeetCode 1581. 进店却未进行过交易的顾客
##题目 表：Visits ```sql + + + | Column Name | Type | + + + | visit_id | int | | customer_id | int | + + + visit_id 是该表中具有唯一值的列。 该表包含有关光临过购物中心的顾客的信息。 ``` ......
Leetcode 19. 删除链表的倒数第N个结点(Remove nth node from end of list)
[题目链接](https://leetcode.cn/problems/remove-nth-node-from-end-of-list) 给你一个链表, 删除链表的倒数第n个结点, 并且返回链表的头结点. 示例 1: ``` 输入：head = [1,2,3,4,5], n = 2 输出：[1,2 ......
Leetcode148 排序链表
148. 排序链表 - 力扣（LeetCode） /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nullptr ......
LeetCode -- 151. 反转字符串中的单词(手写一个trim函数)
本题我们采用 class Solution { public: string reverseWords(string s) { stack<string> stk; int n = s.size(), l = 0, r = n - 1; //trim函数 while(l < n && s[l] == ......
第 358 场周赛 - 力扣（LeetCode）
# [第 358 场周赛 - 力扣（LeetCode）](https://leetcode.cn/contest/weekly-contest-358/) ## [2815. 数组中的最大数对和 - 力扣（LeetCode）](https://leetcode.cn/problems/max-pai ......
【leetcode】404 左叶子之和
https://leetcode.cn/problems/sum-of-left-leaves/description/ 【分析】 该题要求左叶子之和。 如果我们对当前节点进行叶子节点的判断，那么我们是不知道当前节点是左叶子还是右叶子的。 所以我们应该在叶子结点的上层（父节点）进行判断。 【代码】 ......