题库 总和leetcode 39
[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 ......
Docker: Temporary failure resolving 'deb.debian.org'
坑爹啊 docker安装某个软件 然后就报这个错 然后重启下docker就好了 Docker: Temporary failure resolving 'deb.debian.org' 或者修改下/etc/docker/daemon.json 再重启 { "dns": ["8.8.8.8", "8. ......
LeetCode 1011. Capacity To Ship Packages Within D Days 二分答案
A conveyor belt has packages that must be shipped from one port to another within `days` days. The ith package on the conveyor belt has a weight of $w ......
阿里云centos Can't connect to MySQL server on ':3306' (61)
Can't connect to MySQL server on ':3306' (61) /etc/mysql/my.cnf 修改bind-address也不行mysql给root远程授权也不行阿里云安全组也添加了3306最后发现是防火墙问题解决办法 firewall-cmd --zone=pub ......
leetcode练习
## 分类 题单：[code](#code) 难度：[简单](#Simple) [中等](#middle) [困难](#hard) 类型：[数组](#数组) [链表](#链表) [字符串](#字符串) [二叉树](#二叉树) [排序](#排序) 解法：[递归和迭代](#递归和迭代) [滑动窗口 ]( ......
leetcode 546. 移除盒子
1. 题目 读题 链接：https://www.nowcoder.com/questionTerminal/a5390d76441647fbb182f34bee6a1ca7来源：牛客网一维消消乐 小v在vivo手机的应用商店中下载了一款名为“一维消消乐”的游戏，介绍如下： 1、给出一些不同颜色的豆子 ......
uniapp专栏 —— vscode报错 'uni' is not defined.
## 写在前面 这些内容基于通过cli搭建的uniapp项目，使用了vite4,ts4.9,vue3（组合式API,setup语法糖）。如果有版本不一致，请谨慎参考。 ## 正文 uni是一个全局变量，但是eslint没有识别到。 ### 避免这个错误报错 在.eslintrc.js文件中加上配置 ......
[LeetCode] 2461. Maximum Sum of Distinct Subarrays With Length K
You are given an integer array nums and an integer k. Find the maximum subarray sum of all the subarrays of nums that meet the following conditions: T ......
[LeetCode] 2222. Number of Ways to Select Buildings
You are given a 0-indexed binary string s which represents the types of buildings along a street where: s[i] = '0' denotes that the ith building is an ......
Leetcode日记
| 日期 | 题号 | 题目 | 解法 | 难度 | | | | | | | | 2023-07-11 | 2741 | [给定一个互不相同的正整数数组，找出**特别排列**（相邻元素互模任一为0）的总数目。取余](https://leetcode.cn/problems/special-permu ......
[未解决] vue transform-blocks解析源代码报错：Illegal tag name. Use '<' to print '<'.
报错内容： [vite] Internal server error: Illegal tag name. Use '<' to print '`标签后报错，但其他vue文件可以正常读取和展示。 报错的文件，去掉``标签就可以正常加载。报错的方法是vue-compiler的`baseParse()` ......
[LeetCode] 874. Walking Robot Simulation
A robot on an infinite XY-plane starts at point (0, 0) facing north. The robot can receive a sequence of these three possible types of commands: -2: T ......
[LeetCode] 2597. The Number of Beautiful Subsets
You are given an array nums of positive integers and a positive integer k. A subset of nums is beautiful if it does not contain two integers with an a ......
LeetCode 852. Peak Index in a Mountain Array 二分
An array arr a mountain if the following properties hold: * `arr.length` >= 3 * There exists some i with `0 arr[i + 1] > ... > arr[arr.length - 1] ``` ......
invalidate the cache in Spark by running 'REFRESH TABLE tableName' command in SQL or by recreating the Dataset/DataFrame involved
``` ... 1 more Caused by: java.io.FileNotFoundException: File does not exist: hdfs://ns1/user/hive/warehouse/dw.db/dw_uniswapv3_position_detail/pk_day ......
加速github访问、git使用及其原理、错误error: remote origin already exists，error: src refspec master does not match any，fatal: unable to access 'https://github.com/xxx.git'（你的仓库地址）
访问Github Github：https://github.com 修改hosts 1.在C:\Windows\System32\drivers\etc找到hosts 2.将hosts文件复制到其他位置（D盘等等），再复制一份备份 3.将 #github 20.205.243.166 github ......
关于网址最后的'/'
如果是True， 在url.py里配置成 path("login/user/", view.user) 浏览器中输入 http://192.168.0.1:8000/login/user 回车之后会在后面自动加/ 请求方式只能是GET 不能是POST ......
Troubles in RunBase's Pack and Unpack Methods
### Trouble description: > When user processed the batch job after clearing the usage data, dialog's parameters will catch the current data from proce ......
leetcode104二叉树搜索
深度优先搜索，递归 maxDepth(TreeNode* root){ if(!root)return 0; return max(maxDepth(root->left),maxDepth(root->right))+1; } 广度优先搜索，队列 queue<TreeNode*>q; q.push ......