minimums
[LeetCode] 712. Minimum ASCII Delete Sum for Two Strings
Given two strings s1 and s2, return the lowest ASCII sum of deleted characters to make two strings equal. Example 1: Input: s1 = "sea", s2 = "eat" Out ......
[LeetCode] 1870. Minimum Speed to Arrive on Time
You are given a floating-point number hour, representing the amount of time you have to reach the office. To commute to the office, you must take n tr ......
[ABC308G] Minimum Xor Pair Query 题解
[Minimum Xor Pair Query](https://www.luogu.com.cn/problem/AT_abc308_g) ### 题目大意 维护一个序列,支持动态插入,删除,查询最小异或对。 ### 思路分析 看到查询最小异或对首先想到 01Trie,但 01Trie 不支持删除 ......
871.minimum number of refueling stops
Description 871.minimum-number-of-refueling-stops Solution Dynamic programming In this problem, the number is finite, and there is a recurrence relati ......
1775.equal sum arrays with minimum number of operations
Description 1775.equal-sum-arrays-with-minmum-number-of-operations Solution hash table + greedy algorithm The general idea of this problem is hash + g ......
[LeetCode] 2208. Minimum Operations to Halve Array Sum
You are given an array nums of positive integers. In one operation, you can choose any number from nums and reduce it to exactly half the number. (Not ......
[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] 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 ......
1851. Minimum Interval to Include Each Query (Hard)
Description 1851. Minimum Interval to Include Each Query (Hard) You are given a 2D integer array intervals, where intervals[i] = [lefti, righti] descr ......
[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 ......
UVA10791 最小公倍数的最小和 Minimum Sum LCM 题解
### 前言 长沙市一中8机房0714模拟测1。 [传送门](https://www.luogu.com.cn/problem/UVA10791) [blog](https://www.luogu.com.cn/blog/JJL0610666/solution-uva10791) # 思路 本题思路 ......
[LeetCode] 931. Minimum Falling Path Sum
Given an n x n array of integers matrix, return the minimum sum of any falling path through matrix. A falling path starts at any element in the first ......
AtCoder Beginner Contest 308 G Minimum Xor Pair Query
[洛谷传送门](https://www.luogu.com.cn/problem/AT_abc308_g "洛谷传送门") [AtCoder 传送门](https://atcoder.jp/contests/abc308/tasks/abc308_g "AtCoder 传送门") 考虑没有删除操作怎 ......
[ABC297F] Minimum Bounding Box 2
[也许更好的阅读体验](https://blog.csdn.net/Morning_Glory_JR/article/details/131456608?csdn_share_tail=%7B%22type%22%3A%22blog%22%2C%22rType%22%3A%22article%22% ......
node生成token报错:secretOrPrivateKey has a minimum key size of 2048 bits for RS256 at Object.module.exports [as sign]
提要:在node生成token时 利用用jsonwebtoken,利用非对称加密的生成token const jwt = require("jsonwebtoken"); const privateKey = fs.readFileSync("./keys/private.key"); const ......
1595. Minimum Cost to Connect Two Groups of Points] (Hard)
Description 1595. Minimum Cost to Connect Two Groups of Points (Hard) You are given two groups of points where the first group has size1 points, the s ......
2712. Minimum Cost to Make All Characters Equal (Medium)
Description 2712. Minimum Cost to Make All Characters Equal (Medium) You are given a 0-indexed binary string s of length n on which you can apply two ......
2712.minimum Cost to Make All Characters Equal
Description 2712. Minimum Cost to Make All Characters Equal (Medium) You are given a 0-indexed binary string s of length n on which you can apply two ......
关于mkfs.xfs创建xfs文件系统指定block-size为512字节时报错-Minimum block size for CRC enabled filesystems is 1024 bytes.
今天笔者看到mkfs.xfs命令的帮助文档手册时,有如下一段内容 可以通过-b size=value 的方式指定 block的大小,默认值是4096 bytes,最小为512 ,最大为65536 The default value is 4096 bytes (4KiB), the minimum ......
[LeetCode] 1347. Minimum Number of Steps to Make Two Strings Anagram 制造字母异位词的最小步骤数
You are given two strings of the same length `s` and `t`. In one step you can choose **any character** of `t` and replace it with **another character* ......
【Oracle】Resize your Oracle datafiles down to the minimum without ORA-03297
--In non-multitenant DB set linesize 1000 pagesize 0 feedback off trimspool on with hwm as ( -- get highest block id from each datafiles ( from x$ktfb ......
Codeforces Round 837 (Div. 2) F. Hossam and Range Minimum Query
[传送门](https://codeforces.com/contest/1771/problem/F) 大致题意: ** 给一个n,然后给一个数组a, 有m个询问,询问区间[l, r]出现次数为奇数的最小值,若没有输出0, 每次输入的l,r需要异或上上一个答案,在第一个询问的时候认为上一个答案为0 ......
AtCoder Regular Contest 130 E Increasing Minimum
这题太神仙了吧!感觉还不是很懂,但是尽力理一下思路。 设 $t_x$ 为最大的 $j$ 使得 $i_j = x$,不存在则 $t_x = 0$。 设 $1 \sim n$ 的数按照 $t$ 从小到大排序后是 $p_1, p_2, ..., p_n$,设 $q_i$ 为 $i$ 在 $p$ 中的排名, ......
KingbaseES V8R6 集群运维案例--备库timeline not contain minimum recovery point故障
案例现象: KingbaseES V8R6集群备库启动后,加入集群失败,sys_log日志信息提示,如下图所示: 适用版本: kingbaseES V8R6 一、问题分析 在timeline对应的history文件中会记录每次timeline切换时所对应的lsn,如下图所示,在sys_wal目录 ......
[LeetCode] 1419. Minimum Number of Frogs Croaking
You are given the string croakOfFrogs, which represents a combination of the string "croak" from different frogs, that is, multiple frogs can croak at ......
ABC297F AtCoder Beginner Contest 297 F - Minimum Bounding Box 2
https://atcoder.jp/contests/abc297/tasks/abc297_f 在 $n \times m$ 的棋盘上放置 $k$ 个棋子,记矩形 A 为能覆盖所有 $k$ 个棋子的最小的矩形,求 A 的面积的期望 将问题反过来考虑,枚举每种矩形有多少种放置棋子的方案,对于一个 ......
Minimum Number of Visited Cells in a Grid
Minimum Number of Visited Cells in a Grid You are given a 0-indexed m x n integer matrix grid . Your initial position is at the top-left cell (0, 0). ......
Minimum Reverse Operations
Minimum Reverse Operations You are given an integer n and an integer p in the range [0, n - 1]. Representing a 0-indexed array arr of length n where a ......