determine leetcode conflict events
[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 ......
Codility / LeetCode的重要性与注意事项
Codility / Leetcode 不只会针对回答内容给出最终分数，也会一并记录解题的过程供面试官参考; 相较于现场考试，Codility / Leetcode可以省下更多时间，也能让求职者在最熟悉的环境发挥实力。 进行测验前 先查看Codility / Leetcode FAQ，并完成demo ......
[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 ......
VTK mouse event -- 捕捉鼠标动作并发送信号：vtkCommand
头文件申明： ```C++ #pragma once #include #include #include #include #include #include class MyMouseCallback : public QObject, public vtkCommand { Q_OBJECT ......
[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 ......
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 ......
leetcode练习
## 分类 题单：[code](#code) 难度：[简单](#Simple) [中等](#middle) [困难](#hard) 类型：[数组](#数组) [链表](#链表) [字符串](#字符串) [二叉树](#二叉树) [排序](#排序) 解法：[递归和迭代](#递归和迭代) [滑动窗口 ]( ......
leetcode 546. 移除盒子
1. 题目 读题 链接：https://www.nowcoder.com/questionTerminal/a5390d76441647fbb182f34bee6a1ca7来源：牛客网一维消消乐 小v在vivo手机的应用商店中下载了一款名为“一维消消乐”的游戏，介绍如下： 1、给出一些不同颜色的豆子 ......
[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 ......
[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] ``` ......
leetcode104二叉树搜索
深度优先搜索，递归 maxDepth(TreeNode* root){ if(!root)return 0; return max(maxDepth(root->left),maxDepth(root->right))+1; } 广度优先搜索，队列 queue<TreeNode*>q; q.push ......
LeetCode 301. 删除无效的括号
``` class Solution { public: vector ans; vector removeInvalidParentheses(string s) { //lr分别记录要删除的左右括号数量 int l=0,r=0; for(auto c:s) if(c=='(') l++; els ......
[LeetCode] 1851. Minimum Interval to Include Each Query
You are given a 2D integer array intervals, where intervals[i] = [lefti, righti] describes the ith interval starting at lefti and ending at righti (in ......