学习笔记

#include<iostream>using namespace std;int main(){ string s; getline(cin, s); cout << s << endl; return 0;}

字符串去除前后空格void trim(string &s){ if(!s.empty() ){ s.erase(0, s.find_first_not_of(" ")); s.erase(s.find_last_not_of(" ") + 1); }}对map和set进行排序可以将元素项转换为vector的元素,然后排序后输出#include <iostream>#include <string>#incl

#include <iostream>#include <sstream>#include <string>using namespace std;// 数字转字符串void toString(string &s, int &num){ stringstream ss; ss << num; ss >> s;}// 字符串转数字void toInt(string &s, int &

#include <iostream>#include <vector>#include <algorithm>#include <cstdio>using namespace std;struct Node{ int num; string name; Node(int num, string name){ this->num = num; this->name = name

#include <iostream>#include <cstdio>#include <vector>#include <set>#include <string>#include <map>#include <unordered_map>#include <queue>#include <stack>#include <algorithm>using names

#include <iostream>#include <vector>#include <list>#include <stack>#include <queue>#include <string>// list: 双向链表using namespace std;int main() { list<string> ls; ls.push_back("abc"); // 后面添加元素

#include <iostream>using namespace std;struct Node{ int x; int y;};// int * Node 时调用, 返回Node类型, Node = int * Node Node operator * (int a, Node b){ Node r; r.x = a * b.x; r.y = a * b.y; return r;}// int + Node 时调用

#include<iostream>#include<algorithm>#include<map>#include<set>#include<vector>using namespace std; int main(){ string s{"aawdwwd"};// s.erase(1,3); // 第一个参数指定从此索引位置开始删除，第二个元素指定删除的长度，如果无则会删除从索引对应的元素之后的所有元素 // cout &l