总和leetcode 39
安装 MySQL for Windows 时报错 The configuration for MySQL Server 8.0.34 has failed. You can find more information about the failures in the 'Log' tab. 解决方法
今天在安装 MySQL for Windows 时报错 ```txt The configuration for MySQL Server 8.0.34 has failed. You can find more information about the failures in the 'Log' ......
idea启动总是报错Error running 'Tomcat 9.0.6': Unable to open debugger port (127.0.0.1:57757): java.net.SocketException "socket closed"，但是我57757端口实际上并没有被使用
问题：当遇到idea启动报错"Error running 'Tomcat 9..6': Unable to open debugger port (127.0.0.1:57757): java.net.SocketException "socket closed""时，很多人可能会尝试改变debug ......
[LeetCode] 2297. Jump Game VIII
You are given a 0-indexed integer array nums of length n. You are initially standing at index 0. You can jump from index i to index j where i < j if: ......
leetcode 28 459 总结 KMP算法
[toc] #28 ##解法一，暴力法 ``` //暴力 if(haystack.length() pi(m); for (int i = 1, j = 0; i 0 && needle[i] != needle[j]) { j = pi[j - 1]; } if (needle[i] == nee ......
[LeetCode] 2408. Design SQL
You are given n tables represented with two arrays names and columns, where names[i] is the name of the ith table and columns[i] is the number of colu ......
leetcode-1518-easy
Water Bottles ``` There are numBottles water bottles that are initially full of water. You can exchange numExchange empty water bottles from the marke ......
TypeScript 二维数组生成 要注意初始化 TypeError: Cannot set properties of undefined (setting '1')
private _dataMap:Vec3[][] = []; private _userDataMap:number[][] = []; init() { for(let i = 1; i <= 4; i++){ for(let j = 1; j <= 4; j++){this._dataMap[ ......
CF718E Matvey's Birthday
不难发现答案 $\le 15$，极限的情况大概就是 $aabbcc\cdots gghh$，此时跳一步和走一步等效。 这启示我们固定点 $i$，统计 $d(i,j)=D,j15$ 的贡献。 为了方便，以下称从 $i$ 到 $i+1$ 或 $i-1$ 为「走」，在相同颜色的点之间移动为「跳」。对于既可 ......
CF1530H Turing's Award
参考官方题解。 你发现这个覆盖不太好考虑，考虑时间倒流，变成如下形式： > 一开始，小 A 的位置上有一个数 $a_n$，然后对于接下来 $n-1$ 步，每次小 A 可以向左走/向右走/不动，然后如果此时小 A 所站的位置上**没有数**，就写上 $a_i$，求最后形成序列的最长上升子序列长度。 考 ......
437. 路径总和 III
题目： 给定一个二叉树的根节点 root ，和一个整数 targetSum ，求该二叉树里节点值之和等于 targetSum 的 路径 的数目。 路径 不需要从根节点开始，也不需要在叶子节点结束，但是路径方向必须是向下的（只能从父节点到子节点）。 示例 1： 输入：root = [10,5,-3,3 ......
Codility / LeetCode的重要性与注意事项
Codility / Leetcode 不只会针对回答内容给出最终分数，也会一并记录解题的过程供面试官参考; 相较于现场考试，Codility / Leetcode可以省下更多时间，也能让求职者在最熟悉的环境发挥实力。 进行测验前 先查看Codility / Leetcode FAQ，并完成demo ......
flak创建数据库报 NameError: name 'MySQLdb' is not defined
因为pycharm中无法安装MySQLdb ,安装会报错 所以安装pymysql 然后替换MySQLdb 进入到mysqldb.py文件中 替换mysqldb方法，导入pymysql 取别名为MySQLdb 再次执行便能成功 ......
NVIDIA-SMI has failed because it couldn't communicate with the NVIDIA driver. Make sure that the latest NVIDIA driver is installed and running.
###问题提示： ` NVIDIA-SMI has failed because it couldn't communicate with the NVIDIA driver. Make sure that the latest NVIDIA driver is installed and runn ......
代码随想录算法训练营第三十四天| 完全背包 518. 零钱兑换 II 377. 组合总和 Ⅳ
完全背包 区别： 每种物品都是可以无线多个 代码： 1 // 多背包问题 2 // 有N个物品，他们的体积和重量如下，但是这些物品有无限个 3 // 需要发挥背包的最大容量，来让价值最大 4 // 5 // dp[n]: 当容量为N的时候，背包的价值最大是多少 6 // dp[n]: 7 // dp ......
[LeetCode] 2268. Minimum Number of Keypresses
You have a keypad with 9 buttons, numbered from 1 to 9, each mapped to lowercase English letters. You can choose which characters each button is match ......
[LeetCode] 2323. Find Minimum Time to Finish All Jobs II
You are given two 0-indexed integer arrays jobs and workers of equal length, where jobs[i] is the amount of time needed to complete the ith job, and w ......
[LeetCode] 2330. Valid Palindrome IV
You are given a 0-indexed string s consisting of only lowercase English letters. In one operation, you can change any character of s to any other char ......
[LeetCode] 2340. Minimum Adjacent Swaps to Make a Valid Array
You are given a 0-indexed integer array nums. Swaps of adjacent elements are able to be performed on nums. A valid array meets the following condition ......
[LeetCode] 2422. Merge Operations to Turn Array Into a Palindrome
You are given an array nums consisting of positive integers. You can perform the following operation on the array any number of times: Choose any two ......
[LeetCode] 1676. Lowest Common Ancestor of a Binary Tree IV
Given the root of a binary tree and an array of TreeNode objects nodes, return the lowest common ancestor (LCA) of all the nodes in nodes. All the nod ......
LeetCode之0661, 二维向量初始化
img[i][j]周围的单元格，img[i+i1][j+j1], i1=-1,0,1, j1=-1,0,1, 每个都判断一次。O(9*m*n) class Solution { public: std::vector<std::vector<int>> imageSmoother( std::vec ......
Leetcode之0709, 修改字符串
1 class Solution { 2 public: 3 string toLowerCase(string s) { 4 for(char &ch: s){ 5 if(ch>='A' && ch<='Z'){ 6 ch=tolower(ch); 7 } 8 } 9 return s; 10 } ......
[LeetCode] 2486. Append Characters to String to Make Subsequence
You are given two strings s and t consisting of only lowercase English letters. Return the minimum number of characters that need to be appended to th ......
Linux系统Apache报错httpd: Could not reliably determine the server's fully qualified domain name, using localhost.localdomain. Set the 'ServerName' directive globally to suppress this message
解决办法： 在配置文件中加一句ServerName localhost:端口号 # echo "ServerName localhost:8068" >> /etc/httpd/conf/httpd.conf 重启Apache即可解决。 ......
[刷题记录Day4]Leetcode链表专题
# No.1 ## 题目 [两两交换链表中的节点](https://leetcode.cn/problems/swap-nodes-in-pairs/) ## 思路 - 模拟类型题目 - 两个节点前后交换，同时记住原来的下一个节点 - 虚拟头节点 ## 代码 ```Java public ListN ......
LeetCode 1201. Ugly Number III 数学+二分答案
An ugly number is a positive integer that is divisible by $a$, $b$, or $c$. Given four integers $n$, $a$, $b$, and $c$, return the $n$th ugly number. ......
LeetCode 875. Koko Eating Bananas 二分答案
Koko loves to eat bananas. There are $n$ piles of bananas, the $i$th pile has $piles[i]$ bananas. The guards have gone and will come back in `h` hours ......
Null, nullptr, 0, '\0', '0', "0", '',"",' '," "的区别
### Null, nullptr, 0, '\0', '0', "0", '',"",' '," "的区别 - `Null`: `Null`指的是空指针，在c中用**（void*）0**表示，在c++中用**0**表示 1. 任何类型的两个空指针**比较相等** 2. C标准没有说空指针与**指向 ......
vue项目安装lees-loader报错：Module build failed: Error: Cannot find module 'less'
1-新搭建的一个项目，运行时报Module build failed: Error: Cannot find module 'less'错误 原因：vue文件里面的style添加了 lang="less" 解决方案： 安装less npm install less 2-安装less后运行报错： Mo ......