打家劫舍leetcode动态337
Leetcode 160. 链表相交(Intersection of two linked lists lcci)
[题目链接](https://leetcode.cn/problems/intersection-of-two-linked-lists-lcci/description) 给定两个单链表的头节点headA和headB, 请找出并返回两个单链表相交的起始节点. 如果两个链表没有交点, 返回null. ......
【数据结构】动态树
# 【数据结构】动态树 动态树(Link-Cut Tree),是OI中一种高级的数据结构,用于维护一个动态森林上的链上问题。性价比较高。 ### 题目描述 给定 $n$ 个点以及每个点的权值,要你处理接下来的 $m$ 个操作。 操作有四种,操作从 $0$ 到 $3$ 编号。点从 $1$ 到 $n$ ......
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( ......
【树】树上动态规划
[TOC] # 引入 考虑这样一个问题(P1352 没有上司的舞会): > 一棵树,每个节点 $i$ 都有价值 $v_i$,对于每个子节点,不能和父节点同时选择,求最大价值和。 令 `dp[x][0]` 为在x的子树中表示i不取时值最大是多少。 令 `dp[x][1]` 为在x的子树中表示i取时值最 ......
微信小程序动态绑定class样式类(三木运算)
直接上代码,循环列表,根据选中状态显示不同的样式,active就是你在wxss文件里面创建的类名 <view class="{{item.select ? 'active':''}}" wx:for="{{itemList}}" wx:key="{{item.id}}"> {{item.name}} ......
济南 CSP-J 刷题营 Day3 动态规划
# Solution ## T1 方格涂色 ### 原题链接 [**4085: 方格涂色**](https://noip.ac/rs/show_problem/4085 "**4085: 方格涂色**") ### 简要思路 分列进行讨论,只有三种状态:选了上面、选了下面、上下都没选。只需讨论一下状态 ......
[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][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 ......
C++快速入门 第三十四讲:动态数组
虽然前面讲过的用new给基本类型和对象在运行时分配内存,但它们的尺寸在编译时就已经确定下来——因为我们为之申请内存的数据类型在程序中有明确的定义,有明确的单位长度。 但有些时候,必须等到程序运行时才能确定需要申请多少内存,甚至还需要根据程序的运行情况追加申请更多的内存。 例如: int *x = n ......
C++快速入门 第三十三讲:动态的内存管理
到目前为止,所讲解的每个示例程序在完成它的任务时所使用的内存空间都是固定不变的。不能在程序运行期间动态增加或减少内存空间(即静态内存)。 在很多时候,需要存储的数据量到底有多大在事先往往是一个未知数,想要处理好这类情况,就需要在C++程序里使用动态内存。 动态内存由一些没有名字、只有地址的内存块构成 ......
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 ......
ElementUI——vue2+element-ui 2.x的动态表格和表单
# 前言 一个基于vue2.x + element-ui 2.x版本的项目,里面都是CURD的东西,但是前人并未封装组件,而是直接CV,现在要新增一个大模块的功能,就想着封装个组件,后面再基于这个组件对老项目进行改造; > 虽然是一个大模块,但是功能还是比较简单的,结构如下; ![](https:/ ......
Linuxy应用程序加载动态链接库的默认路径
在 Linux 系统中,当应用程序执行时,系统会按照一定的规则去寻找动态链接库(也称为共享库或 `.so` 文件)。系统使用一组默认的搜索路径来查找这些库,以便在运行时正确加载所需的库。以下是 Linux 系统寻找动态链接库的一般规则: 1. **系统默认路径**: Linux 系统会在一组默认的路 ......
【LeetCode1270. 向公司CEO汇报工作的所有人】with recursive找到某节点所有的后代
# 题目地址 https://leetcode.cn/problems/all-people-report-to-the-given-manager/description/ # 代码 ``` WITH RECURSIVE cte_subordinates AS ( -- 基础情况: 找到直接下属 ......
GateWay动态路由
之前我们使用网关使用了服务的ip地址,但是这种配置不利于流量的分散 效果图 接口调用了三次,我启动了两个服务,一个服务打印了两次,另一个服务打印了一次,说明实现了负载的功能 网关代码部分 <?xml version="1.0" encoding="UTF-8"?> <project xmlns="h ......
【leetcode】1.two sum
第一题给我干懵了...想达到这个要求把我脑壳都想痛了...Follow-up: Can you come up with an algorithm that is less than O(n2) time complexity? 一开始想过用map,但是不能解决重复key的问题。 然而我用sort, ......