C++STL算法篇（上）

• 基本查找

  • find:区间查找

  • int main()
    {
    	vector<int> v = {1,3,6,8,6,6,2,0,9,0};
    	vector<int>::iterator it=find(v.begin(), v.end(), 8);//区间查找
    	cout << *it << endl;
    }

  • find_if:条件查找

  • int main()
    {
    	vector<int> v = {1,3,6,8,6,6,2,0,9,0};
    	vector<int>::iterator it = find_if(v.begin(), v.end(), [](int a) {return a > 5; });//条件查找
    	cout << *it << endl;
    }
    

  • find_firt_of: 查找区间第一次出现值

  • int main()
    {
    	vector<int> v = {1,3,6,8,6,6,2,0,9,0};
    	vector<int> v2 = { 3,6,8,6,6};
    	vector<int>::iterator it = find_first_of(v.begin(), v.end(), v2.begin(), v2.end());//查找区间第一次出现值
    	cout << *it << endl;
    }

  • adjacent_find: 查找第一次重复的数

  • int main()
    {
    	vector<int> v = {1,3,6,8,6,6,2,0,9,0};
    	//vector<int> v2 = { 3,6,8,6,6};
    	vector<int>::iterator it = adjacent_find(v.begin(), v.end());//查找第一次重复的数
    	cout << *it << endl;
    }

  • search:子序列查找

  • int main()
    {
    	vector<int> v = {1,3,6,8,6,6,2,0,9,0};
    	//vector<int> v2 = { 3,6,8,6,6};
    	int ser[3] = { 3,6,8 };
    	auto it = search(v.begin(), v.end(), ser,ser+3);//子序列查找
    	cout << *it << endl;
    }

  • search_n: 子序列查找出现次数

  • int main()
    {
    	vector<int> v = {1,3,6,8,6,6,2,0,9,0};
    	//vector<int> v2 = { 3,6,8,6,6};
    	int ser[3] = { 3,6,8 };
    	auto it = std::search_n(v.begin(), v.end(), 1,1);//子序列查找出现次数
    	cout << *it << endl;
    }

• 统计查找

  • count: 区间统计

  • int main()
    {
    	vector<int> v = {1,3,6,8,6,6,2,0,9,0};
    	//vector<int> v2 = { 3,6,8,6,6};
    	int ser[3] = { 3,6,8 };
    	auto it=count(v.begin(), v.end(), 6);// 区间统计
    	cout << it << endl;
    }

  • count_if: 条件统计个数

  • int main()
    {
    	vector<int> v = {1,3,6,8,6,6,2,0,9,0};
    	//vector<int> v2 = { 3,6,8,6,6};
    	int ser[3] = { 3,6,8 };
    	auto it = count_if(v.begin(), v.end(), [](int a) {return a > 3; });// 条件统计个数
    	cout << it << endl;
    }

  • equal:比较

  • 	vector<int> v = {1,3,6,8,6,6,2,0,9,0};
    	vector<int> v2 = { 3,6,8,6,6};
    	int ser[3] &