1 Star 1 Fork 0

AlbertDarren / STL

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
克隆/下载
max_min_element.cpp 1.15 KB
一键复制 编辑 原始数据 按行查看 历史
AlbertDarren 提交于 2022-04-03 00:55 . first commit
#include <iostream>
#include <algorithm>
#include <string>
#include <deque>
#include <set>
#include <valarray>
#include <cstdlib>
using namespace std;
struct cmp
{
bool operator()(int v1,int v2)
{
return to_string(v1).size()<to_string(v2).size();
}
};
int main_3()
{
initializer_list<int> il= {14,2,8,1,30,110,220};
cout << *max_element(il.begin(),il.end(),cmp()) << endl;
valarray<int> v {4,2,-3,7,1,8,-9};
v[slice(1,3,2)]=-10;
valarray<int> sqrt_val=sqrt(abs(v));
for(auto val:sqrt_val)
{
cout << val << " ";
}
cout << endl;
deque<int> deq {1,2,4,-6,7,2,8,3,0,7};
random_shuffle(deq.begin(),deq.end());
for (int ele:deq )
{
cout << ele << " ";
}
putchar('\n');
cout << *max_element(deq.begin(),deq.end()) << endl;
cout << *min_element(deq.begin(),deq.end()) << endl;
set<int> s {1,2,4,-6,7,2,8,3,0,7};
for (int ele:s )
{
cout << ele << " ";
}
putchar('\n');
cout << *s.end() << endl;
cout << *s.begin() << endl;
int arr[] {-2,4,-1,5,3,-4,8};
sort(arr,arr+sizeof(arr)/sizeof(int));
cout << *arr << endl;
return 0;
}
C++
1
https://gitee.com/AlbertDarren_admin/stl.git
git@gitee.com:AlbertDarren_admin/stl.git
AlbertDarren_admin
stl
STL
master

搜索帮助