新博客：https://aping-dev.com/

#include "iostream"#include "vector"using namespace std;int main(){ vector<int> v; vector<int>::iterator it; // !! 定义 int i, sum; for(i=0; i<10; i++) v.push_back(i);

#include "iostream"using namespace std;int f1(int n){ return n;}int f2(int n){ return n + n;}void F(int (*pf)(int), int n){ cout << pf(n) << endl;}int main(){ F(f1, 5); F(f2

#include "iostream"#include "string"using namespace std;void f(string s) throw(string){ cout << s << endl; if(s == "error") throw string("exception");}void show1(){ try {

#include "iostream"#include "vector"#include "algorithm"using namespace std;struct C{ int v; // 从小到大排 bool operator < (const struct C &c) const { return v < c.v; }};struc

#include "iostream"#include "vector"#include "algorithm"using namespace std;struct C{ int a; vector<int> v; // 从小到大排 bool operator < (const struct C &c) const { return v <

Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the person and k is the number of people in front of this p

Given an integer, write a function to determine if it is a power of two.Credits: Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.Subscribe to see which compa

Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers suc

转自 http://blog.51cto.com/10740184/1753183scope_ptr注意，将拷贝构造函数和拷贝复制运算符设为私有，表示所有权不能转让。#include&lt;iostream&gt;using namespace std;template&lt;class T&gt;class ScopedPtr{public: ScopedPtr...

转自：http://blog.csdn.net/mormont/article/details/53677363#include "iostream"#include "algorithm"#include "map"using namespace std;char *strtok(char *str, const char *delim){ static char ...

#include "iostream"using namespace std;//必须提前声明，否则会报错class A;ostream& operator << (ostream &out, const A &a);istream& operator >> (istream &in, A &a);A operator + (const A &a1, const A &a2);class

#include "iostream"using namespace std;void f(double *a, int r, int c){ for(int i=0; i<r; i++) for(int j=0; j<c; j++) cout << a[i*c+j] << " ";}int main(){ double a[2][3]

#include <iostream>#include <io.h> #include <string> #include <vector> #include "fstream"using namespace std; void getFiles( string, vector<string>& );int main() { vector

#include "iostream"#include "algorithm"using namespace std;int main(){ int a[3] = {3, 1, 2}; sort(a, a+3); //从小到大排序, 如果不排序，则得不到全部排列结果 do { for(int i=0; i<3; i++)

#include "iostream"#include "vector"#include "string"#include "sstream"using namespace std;int main(){ string s = "aabcdef.txt"; cout << endl << "--------------------------find, rfind-------

#include <iostream> #include <stdlib.h> //rand() srand()#include <time.h> using namespace std;//产生[low, high)之间的随机数double randval(double low, double high) { double val; val = ((d

#include "iostream"#include "vector"#include "set"#include "string"#include "map"#include "algorithm"using namespace std;int main(){ int a[] = {1, 2}; int b[] = {2, 3}; vector<int> s1

#include "iostream"#include "set"using namespace std;int main(){ set<int> s; s.insert(1); s.insert(3); s.insert(2); set<int>::iterator it; it = s.begin(); while(it != s.e

vector 定义vector<int> v;vector<double> v;vector<STU> v; //存放结构体vector<int> v(5); //长度为5常用操作v[i]; //取值v.front(); //获取并返回首元素v.back(); //获取并返回尾元素v.push_back(x); //向尾部插入元素xv.siz

#include "iostream"#include "vector"#include "algorithm"using namespace std;void myPrint(int *a, int row, int col){ for(int i=0; i<row; i++) { for(int j=0; j<col; j++) co

t2.txt 效果 代码#include "iostream"#include "fstream"using namespace std;int main(){ ifstream fin; fin.open("t2.txt"); char str[100]; int N = 13; for(i=0; i<N; i++) { f

获取Debug目录下的txt文件#include <iostream>#include <io.h> #include <string> #include <vector> using namespace std; void getFiles( string, vector<string>& );int main() { vector<stri

题目描述 如何得到一个数据流中的中位数？如果从数据流中读出奇数个数值，那么中位数就是所有数值排序之后位于中间的数值。如果从数据流中读出偶数个数值，那么中位数就是所有数值排序之后中间两个数的平均值。class Solution {public: vector&lt;int&gt; left; // 大顶堆 vector&lt;int&gt; right; // 小顶堆 ...