结点leetcode 19
[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][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][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[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[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[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 ......
计算二叉树双分支结点的个数
结点有左右孩子，count++； 一个是递归算法，没咋明白，书上的，三行代码。 一个是利用层次遍历，出队元素有左右孩子时count++。感觉层次遍历可以解决好多问题 #include <stdio.h> #include <stdlib.h> #define MaxSize 100 typedef ......
【LeetCode1270. 向公司CEO汇报工作的所有人】with recursive找到某节点所有的后代
# 题目地址 https://leetcode.cn/problems/all-people-report-to-the-given-manager/description/ # 代码 ``` WITH RECURSIVE cte_subordinates AS ( -- 基础情况: 找到直接下属 ......
【剑指Offer】62、二叉搜索树的第k个结点
# 【剑指Offer】62、二叉搜索树的第k个结点 **题目描述：** 给定一棵二叉搜索树，请找出其中的第k小的结点。例如（5，3，7，2，4，6，8） 中，按结点数值大小顺序第三小结点的值为4。 **解题思路：** 本题实际上比较简单，主要还是考察对树的遍历的理解，只要熟练掌握了树的三种遍历方式及 ......
【leetcode】1.two sum
第一题给我干懵了...想达到这个要求把我脑壳都想痛了...Follow-up: Can you come up with an algorithm that is less than O(n2) time complexity? 一开始想过用map，但是不能解决重复key的问题。 然而我用sort， ......
.net core发布到IIS上出现 HTTP 错误 500.19
1.检查.net core 环境运行环境是否安装完成，类似如下环境 编辑 2.IIS是否安装全 本次原因就是IIS未安装全导致的 按照网上说的手动重启iis（iisreset）也不行 ......
【题解】#373. 「USACO1.1」Friday the Thirteenth 题解（2023-07-19更新）
# #373. 「USACO1.1」Friday the Thirteenth 题解 **本文章的访问次数为次**。 ## Part 1 提示 ### **[题 ......
【题解】#68. 「NOIP2004」津津的储蓄计划 题解（2023-07-19更新）
# #68. 「NOIP2004」津津的储蓄计划 题解 **本文章的访问次数为次**。 ## Part 1 提示 ### **[题目传送门](https://q ......
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 ......
[代码随想录]Day19-二叉树part08
## 题目：[235. 二叉搜索树的最近公共祖先](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-search-tree/) ### 思路： BST和普通二叉树不同的一点是可以根据特性来找最近公共祖先，只要找到第一个值 ......
遍历二叉树求叶子结点，深度，结点数，以及前序，中序，后序遍历
``` #include // 二叉树结构体 typedef struct BT_node { int data; struct BT_node* left; struct BT_node* right; }BT_node; // 先序遍历 void DLR(BT_node* tree) { if( ......
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] == ......
TPT19新特性
随着汽车行业日新月异的发展，软件定义汽车已逐渐成为大家的追求目标，汽车中的嵌入式软件版本不断迭代，功能也不断增强。为了顺应行业的高速发展和满足客户复杂多变的需求，TPT也在悄悄成长，又一次完成蜕变。接下来随我一起走进TPT19的新世界。 首先，我们通过一则短片，了解TPT19的新特性。 TPT_19 ......
第 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/ 【分析】 该题要求左叶子之和。 如果我们对当前节点进行叶子节点的判断，那么我们是不知道当前节点是左叶子还是右叶子的。 所以我们应该在叶子结点的上层（父节点）进行判断。 【代码】 ......