当前位置:网站首页>Library function -- (continuous update)
Library function -- (continuous update)
2022-07-06 11:24:00 【%xiao Q】
isdigit(): Judge whether the input characters are composed of numbers
char ch;
isdigit(ch)
Random function
srand((unsinged)(time(0))); // Random seeds
int x = rand() % 100 // 0 ~ 100 Number of numbers
Dichotomous function
// Return is greater than the val The address of the value of
upper_bound(a.begin(), a.end(), val);
upper_bound(a, a + n, val, val);
// Return greater than or equal to val The address of the value of
upper_lower(a.begin(), a.end(), val);
upper_lower(a, a + n, val);
Integer to string
int num;
string s = to_string(nmu);
Copy function ( Copy an array to another array )
// vector<> Exchange of containers
vector<int> a, b;
a.assign(b.begin(), b.end()); // hold b Copy to a
// a[] The exchange of arrays
int a[N], b[N];
memcpy(a, b, sizeof b); // hold b Copy to a
sqrt() and log() The return value of the function is floating point
All permutation functions
// n by a The length of the array
next_permutataion(a, a + n) // Next in ascending order , namely 1 2 3 -> 1 3 2 -> 2 1 3 ... , 3 2 1 , And the next if there is a return 1, Otherwise return to 0
prev_permutation(a, a + n) // Next in descending order , namely 3 2 1 -> 3 1 2 ... 1 2 3, And the next if there is a return 1, Otherwise return to 0
Subsequences and substrings
Substring : Successive
Subsequence : It can be discontinuous
Definition of small root heap and large root heap
priority_queue<int> q; // Big root pile
priority_queue<int, vector<int>, greater<int>> q; // Heap
sort From big to small (2 Methods )
int a[N];
sort(a, a + n, greater<int>()) // The in angle brackets are defined according to the array type
bool cmp(int x, y)
{
return x >= y;
}
int main()
{
int a[N];
sort(a, a + n, cmp);
}
All permutation functions (c++)
int a[N];
do
{
...
}next_permutation(a, a + n); // Achieve ascending order
do
{
...
}prev_permutation(a, a + n) // Achieve descending order
Dichotomous function
- lower_bound(): Return greater than or equal to x Array subscript Address
- upper_bound(): Return is greater than the x Array subscript Address
If this number does not exist in the array , Then the array length will be returned .
int t = lower_bound(a, a + n, x) - a; // Because the return is the address , So we need to -a, That is, subtract the array name
int t = upper_bound(a, a + n, x);
边栏推荐
- QT creator custom build process
- FRP intranet penetration
- MySQL主從複制、讀寫分離
- What does usart1 mean
- Armv8-a programming guide MMU (2)
- Leetcode 461 Hamming distance
- QT creator test
- [recommended by bloggers] asp Net WebService background data API JSON (with source code)
- UDS learning notes on fault codes (0x19 and 0x14 services)
- Windows下安装MongDB教程、Redis教程
猜你喜欢
[free setup] asp Net online course selection system design and Implementation (source code +lunwen)
学习问题1:127.0.0.1拒绝了我们的访问
MySQL主从复制、读写分离
Copie maître - esclave MySQL, séparation lecture - écriture
Basic use of redis
csdn-Markdown编辑器
C语言读取BMP文件
Swagger, Yapi interface management service_ SE
Install mysql5.5 and mysql8.0 under windows at the same time
Summary of numpy installation problems
随机推荐
02-项目实战之后台员工信息管理
Ansible practical Series III_ Task common commands
[recommended by bloggers] C WinForm regularly sends email (with source code)
[ahoi2009]chess Chinese chess - combination number optimization shape pressure DP
Database advanced learning notes -- SQL statement
One click extraction of tables in PDF
【博主推荐】asp.net WebService 后台数据API JSON(附源码)
JDBC principle
Solution: log4j:warn please initialize the log4j system properly
What does BSP mean
AcWing 242. A simple integer problem (tree array + difference)
Codeforces Round #771 (Div. 2)
Remember the interview algorithm of a company: find the number of times a number appears in an ordered array
Project practice - background employee information management (add, delete, modify, check, login and exit)
When you open the browser, you will also open mango TV, Tiktok and other websites outside the home page
Ansible practical series I_ introduction
报错解决 —— io.UnsupportedOperation: can‘t do nonzero end-relative seeks
UDS learning notes on fault codes (0x19 and 0x14 services)
Test objects involved in safety test
ES6 Promise 对象