不导翁的博客

头文件#include <cctype>代码示例：#include <cctype>#include <iostream>using namespace std;int main() { string str = "012abcxyzABCXYZ \n\t~`!@#$%^&*()_+{}:\"|<>?[]\\;',./'"; cout << "\tisalnum" << "\tis

简单使用详细参考：https://blog.youkuaiyun.com/disguise666/article/details/85989788struct Student{ //简单起见，只定义两个成绩变量 int num; int math;};struct cmp{ bool operator ()(const Student s1, const Student s2){ return s1.math < s2.math; //最大优先队列, 如

STL源码剖析——空间的配置与释放https://blog.youkuaiyun.com/baidu_28312631/article/details/47610933STL源码剖析——vector的实现原理总结https://blog.youkuaiyun.com/baidu_28312631/article/details/47335847STL源码剖析——deque的实现原理和使用方法详解https://...

【C语言】快速排序函数qsort（）https://blog.youkuaiyun.com/z944733142/article/details/80292613C++排序函数sorthttps://blog.youkuaiyun.com/qq_41139830/article/details/80624216

C++ STL丨string 基本使用（一）https://blog.youkuaiyun.com/MissXy_/article/details/88547282【C++】string详解https://blog.youkuaiyun.com/qq_45239614/article/details/104666598

hanoi塔问题的递归实现的代码#include <stdio.h>#include <stdlib.h>void hanoi(int n, char A, char B, char C){ printf("n = %d\n", n); if(n == 1) printf("%c -> %c\n", A, C); e...

头文件#incldue <string.h>静态数组int num[10]; memset(num, 0, sizeof(num)); //初始化为 0 memset(num, -1, sizeof(num)); //初始化为 -1 memset(num, 127, sizeof(num)); //初始化为无穷大 memset(num, 128, sizeof(num...

C++ - new - 动态数组 - 初始化