'commit'
This commit is contained in:
0
C++专题课程/STL基础知识/.keep
Normal file
0
C++专题课程/STL基础知识/.keep
Normal file
26
C++专题课程/STL基础知识/P1059 明明的随机数.cpp
Normal file
26
C++专题课程/STL基础知识/P1059 明明的随机数.cpp
Normal file
@@ -0,0 +1,26 @@
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
|
||||
|
||||
int main() {
|
||||
int N;
|
||||
cin>>N;
|
||||
int a[N] = {0};
|
||||
for(int i=0;i<N;i++)
|
||||
{
|
||||
cin>>a[i];
|
||||
}
|
||||
sort(a, a + N, less<int>() );
|
||||
|
||||
int n = unique(a, a + N) - a;
|
||||
|
||||
cout<<n<<endl;
|
||||
|
||||
for (int i = 0; i < n; i++)
|
||||
{
|
||||
cout << a[i] << " ";
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
76
C++专题课程/STL基础知识/STL-1-优先队列.cpp
Normal file
76
C++专题课程/STL基础知识/STL-1-优先队列.cpp
Normal file
@@ -0,0 +1,76 @@
|
||||
#include<bits/stdc++.h>
|
||||
|
||||
using namespace std;
|
||||
/*
|
||||
֪ʶ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݣ<EFBFBD>C++ STL <20><><EFBFBD>ȶ<EFBFBD><C8B6><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD>ȶ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ƕ<EFBFBD><EFBFBD>е<EFBFBD>һ<EFBFBD>֣<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Զ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD>ַ<EFBFBD>ʽ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȼ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Զ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>е<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݽ<EFBFBD><EFBFBD>ж<EFBFBD>̬<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
ÿ<EFBFBD>ε<EFBFBD>push<EFBFBD><EFBFBD>pop<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ж<EFBFBD><EFBFBD>ᶯ̬<EFBFBD>ĵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Դﵽ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ԥ<EFBFBD>ڵķ<EFBFBD>ʽ<EFBFBD><EFBFBD><EFBFBD>洢<EFBFBD><EFBFBD>
|
||||
<EFBFBD><EFBFBD><EFBFBD>磬<EFBFBD><EFBFBD>Ԫ<EFBFBD><EFBFBD>5 3 2 4 6<><36><EFBFBD><EFBFBD>push<73><68><EFBFBD><EFBFBD><EFBFBD>ȶ<EFBFBD><C8B6><EFBFBD><EFBFBD>У<EFBFBD>
|
||||
<EFBFBD>涨˳<EFBFBD><EFBFBD>Ϊ<EFBFBD>Ӵ<EFBFBD><EFBFBD><EFBFBD>С<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>˳<EFBFBD><EFBFBD>Ϊ6 5 4 3 2
|
||||
|
||||
<EFBFBD>ĵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݲο<EFBFBD><EFBFBD><EFBFBD>
|
||||
https://www.cnblogs.com/aiguona/p/7200718.html
|
||||
* */
|
||||
struct node {
|
||||
friend bool operator<(node n1, node n2) {
|
||||
return n1.priority < n2.priority;
|
||||
}
|
||||
int priority;
|
||||
int value;
|
||||
};
|
||||
|
||||
int main() {
|
||||
const int len = 5;
|
||||
int i;
|
||||
int a[len] = {3, 5, 9, 6, 2};
|
||||
|
||||
//ʾ<><CABE>1<EFBFBD><31><EFBFBD>Ӵ<EFBFBD><D3B4><EFBFBD>С<EFBFBD><D0A1><EFBFBD><EFBFBD>
|
||||
//priority_queue<int, vector<int>, less<int> > qi; //<2F><EFBFBD>
|
||||
priority_queue<int> qi; //<2F><>д<EFBFBD>汾
|
||||
for (i = 0; i < len; i++)
|
||||
qi.push(a[i]);
|
||||
for (i = 0; i < len; i++) {
|
||||
cout << qi.top() << " ";
|
||||
qi.pop();
|
||||
}
|
||||
cout << endl;
|
||||
|
||||
//ʾ<><CABE>2<EFBFBD><32><EFBFBD><EFBFBD>С<EFBFBD><D0A1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
priority_queue<int, vector<int>, greater<int> > qi2; //С<><D0A1><EFBFBD><EFBFBD>
|
||||
for (i = 0; i < len; i++)
|
||||
qi2.push(a[i]);
|
||||
for (i = 0; i < len; i++) {
|
||||
cout << qi2.top() << " ";
|
||||
qi2.pop();
|
||||
}
|
||||
cout << endl;
|
||||
|
||||
//ʾ<><CABE>3<EFBFBD><33><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȼ<EFBFBD><C8BC><EFBFBD><EFBFBD><EFBFBD>
|
||||
priority_queue<node> qn;
|
||||
node b[len];
|
||||
b[0].priority = 6;
|
||||
b[0].value = 1;
|
||||
|
||||
b[1].priority = 9;
|
||||
b[1].value = 5;
|
||||
|
||||
b[2].priority = 2;
|
||||
b[2].value = 3;
|
||||
|
||||
b[3].priority = 8;
|
||||
b[3].value = 2;
|
||||
|
||||
b[4].priority = 1;
|
||||
b[4].value = 4;
|
||||
|
||||
for (i = 0; i < len; i++)
|
||||
qn.push(b[i]);
|
||||
|
||||
cout << "<EFBFBD><EFBFBD><EFBFBD>ȼ<EFBFBD>" << '\t' << "ֵ" << endl;
|
||||
for (i = 0; i < len; i++) {
|
||||
cout << qn.top().priority << '\t' << qn.top().value << endl;
|
||||
qn.pop();
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
31
C++专题课程/STL基础知识/STL-10-全排列.cpp
Normal file
31
C++专题课程/STL基础知识/STL-10-全排列.cpp
Normal file
@@ -0,0 +1,31 @@
|
||||
#include<bits/stdc++.h>
|
||||
|
||||
using namespace std;
|
||||
|
||||
/*
|
||||
֪ʶ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݣ<EFBFBD>STL ȫ<><C8AB><EFBFBD>к<EFBFBD><D0BA><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
<EFBFBD><EFBFBD>n<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͬԪ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȡm<EFBFBD><EFBFBD>m<EFBFBD><EFBFBD>n<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ԫ<EFBFBD>أ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>˳<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>n<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͬԪ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȡ<EFBFBD><EFBFBD>m<EFBFBD><EFBFBD>Ԫ<EFBFBD>ص<EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>С<EFBFBD>
|
||||
<EFBFBD><EFBFBD>m=nʱ<6E><CAB1><EFBFBD>е<EFBFBD><D0B5><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȫ<EFBFBD><C8AB><EFBFBD>С<EFBFBD><D0A1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>n<EFBFBD><6E><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ôȫ<C3B4><C8AB><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϊn!<21><><EFBFBD><EFBFBD>
|
||||
|
||||
<EFBFBD>ĵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݲο<EFBFBD><EFBFBD><EFBFBD>
|
||||
https://www.cnblogs.com/aiguona/p/7304945.html
|
||||
*/
|
||||
|
||||
using namespace std;
|
||||
|
||||
int main() {
|
||||
int arr[] = {3, 2, 1};
|
||||
cout << "<EFBFBD><EFBFBD>prev_permutation<EFBFBD><EFBFBD>3 2 1<><31>ȫ<EFBFBD><C8AB><EFBFBD><EFBFBD>" << endl;
|
||||
do {
|
||||
cout << arr[0] << ' ' << arr[1] << ' ' << arr[2] << '\n';
|
||||
} while (prev_permutation(arr, arr + 3)); ///<2F><>ȡ<EFBFBD><C8A1>һ<EFBFBD><D2BB><EFBFBD>ϴ<EFBFBD><CFB4>ֵ<EFBFBD><D6B5><EFBFBD><EFBFBD><EFBFBD><EFBFBD>У<EFBFBD><D0A3><EFBFBD><EFBFBD><EFBFBD>3<EFBFBD><33>Ϊ2<CEAA><32>ֻ<EFBFBD><D6BB>ǰ<EFBFBD><C7B0><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȫ<EFBFBD><C8AB><EFBFBD><EFBFBD>
|
||||
|
||||
int arr1[] = {1, 2, 3};
|
||||
cout << "<EFBFBD><EFBFBD>next_permutation<EFBFBD><EFBFBD>1 2 3<><33>ȫ<EFBFBD><C8AB><EFBFBD><EFBFBD>" << endl;
|
||||
do {
|
||||
cout << arr1[0] << ' ' << arr1[1] << ' ' << arr1[2] << '\n';
|
||||
} while (next_permutation(arr1, arr1 + 3)); ///<2F><>ȡ<EFBFBD><C8A1>һ<EFBFBD><D2BB><EFBFBD>ϴ<EFBFBD><CFB4>ֵ<EFBFBD><D6B5><EFBFBD><EFBFBD><EFBFBD><EFBFBD>У<EFBFBD><D0A3><EFBFBD><EFBFBD><EFBFBD>3<EFBFBD><33>Ϊ2<CEAA><32>ֻ<EFBFBD><D6BB>ǰ<EFBFBD><C7B0><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȫ<EFBFBD><C8AB><EFBFBD><EFBFBD>
|
||||
///ע<><D7A2><EFBFBD><EFBFBD><EFBFBD><EFBFBD>˳<EFBFBD><EFBFBD>ҪʱҪ<CAB1><D2AA><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ƚ<EFBFBD><C8BD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
return 0;
|
||||
}
|
||||
48
C++专题课程/STL基础知识/STL-2-栈和队列.cpp
Normal file
48
C++专题课程/STL基础知识/STL-2-栈和队列.cpp
Normal file
@@ -0,0 +1,48 @@
|
||||
#include<bits/stdc++.h>
|
||||
|
||||
using namespace std;
|
||||
/*
|
||||
֪ʶ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݣ<EFBFBD>C++ STL ջ<>Ͷ<EFBFBD><CDB6><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
ջ<EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ա<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɾ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ԫ<EFBFBD>صIJ<EFBFBD><EFBFBD><EFBFBD>ֻ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ա<EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD>˽<EFBFBD><EFBFBD>С<EFBFBD>
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>(Queue)Ҳ<><D2B2>һ<EFBFBD><D2BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><DEB5><EFBFBD><EFBFBD>Ա<EFBFBD><D4B1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ջ<EFBFBD><D5BB>ͬ<EFBFBD><CDAC><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͷ<EFBFBD><CDB7><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƣ<EFBFBD><C6A3><EFBFBD><EFBFBD><EFBFBD>ֻ<EFBFBD><D6BB><EFBFBD>ڱ<EFBFBD><DAB1><EFBFBD>һ<EFBFBD>˽<EFBFBD><CBBD><EFBFBD>(ֻ<><D6BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD>)<29><>
|
||||
<EFBFBD><EFBFBD>ɾ<EFBFBD><EFBFBD>ֻ<EFBFBD><EFBFBD><EFBFBD>ڱ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD>˽<EFBFBD><EFBFBD><EFBFBD>(ֻ<><D6BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD>)<29><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɾ<EFBFBD><C9BE><EFBFBD><EFBFBD>һ<EFBFBD>˳<EFBFBD>Ϊ<EFBFBD><CEAA>β(rear)<29><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD>˳<EFBFBD>Ϊ<EFBFBD><CEAA>ͷ (Front),
|
||||
|
||||
<EFBFBD>ĵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݲο<EFBFBD><EFBFBD><EFBFBD>
|
||||
https://www.cnblogs.com/aiguona/p/7200837.html
|
||||
* */
|
||||
int main()
|
||||
{
|
||||
//<2F><><EFBFBD><EFBFBD>
|
||||
queue<int> q;
|
||||
//ջ
|
||||
stack<char> s;
|
||||
|
||||
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><D2BB>Ԫ<EFBFBD><D4AA>1
|
||||
q.push(1);
|
||||
|
||||
//<2F>ж<EFBFBD><D0B6>Dz<EFBFBD><C7B2><EFBFBD>Ϊ<EFBFBD><CEAA>
|
||||
cout << q.empty() << endl; //<2F><><EFBFBD><EFBFBD>ջΪ<D5BB>շ<EFBFBD><D5B7><EFBFBD>true<75><65><EFBFBD><EFBFBD><EFBFBD><EFBFBD>false
|
||||
|
||||
//<2F><><EFBFBD><EFBFBD><EFBFBD>ڶ<EFBFBD><DAB6><EFBFBD>Ԫ<EFBFBD><D4AA>2
|
||||
q.push(2);
|
||||
|
||||
cout << q.front() << endl;
|
||||
q.pop();
|
||||
// <20><><EFBFBD>ض<EFBFBD><D8B6><EFBFBD>Ԫ<EFBFBD>ص<EFBFBD>ֵ<EFBFBD><D6B5><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɾ<EFBFBD><C9BE><EFBFBD><EFBFBD>Ԫ<EFBFBD><D4AA>
|
||||
cout << q.front() << endl;
|
||||
//ɾ<><C9BE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ԫ<EFBFBD>ص<EFBFBD><D8B5><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֵ
|
||||
q.pop();
|
||||
//<2F><><EFBFBD><EFBFBD>ջΪ<D5BB>շ<EFBFBD><D5B7><EFBFBD>true<75><65><EFBFBD><EFBFBD><EFBFBD><EFBFBD>false
|
||||
cout << q.empty() <<endl;
|
||||
//======================================================================
|
||||
//<2F><><EFBFBD><EFBFBD>Ԫ<EFBFBD><D4AA>2
|
||||
s.push(2);
|
||||
cout << s.top() <<endl;
|
||||
|
||||
//<2F><><EFBFBD><EFBFBD>ջ<EFBFBD><D5BB><EFBFBD><EFBFBD>Ԫ<EFBFBD>أ<EFBFBD><D8A3><EFBFBD><EFBFBD><EFBFBD>ɾ<EFBFBD><C9BE><EFBFBD><EFBFBD>Ԫ<EFBFBD><D4AA>
|
||||
s.push(3);
|
||||
cout << s.top();
|
||||
s.pop();
|
||||
cout << s.top();
|
||||
}
|
||||
47
C++专题课程/STL基础知识/STL-3-vector向量.cpp
Normal file
47
C++专题课程/STL基础知识/STL-3-vector向量.cpp
Normal file
@@ -0,0 +1,47 @@
|
||||
#include<bits/stdc++.h>
|
||||
|
||||
using namespace std;
|
||||
|
||||
/*
|
||||
֪ʶ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݣ<EFBFBD>C++ STL vector<6F><72><EFBFBD><EFBFBD>
|
||||
|
||||
vector(<28><><EFBFBD><EFBFBD>):<3A><>һ<EFBFBD><D2BB>˳<EFBFBD><CBB3><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʵ<EFBFBD>Ϻ<EFBFBD><CFBA><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>࣬<EFBFBD><E0A3AC><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Խ<EFBFBD><D4BD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD>˵<EFBFBD><CBB5><EFBFBD>鲻<EFBFBD>ܶ<EFBFBD>̬<EFBFBD><CCAC>չ<EFBFBD><D5B9>
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڳ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>е<EFBFBD>ʱ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>˷<EFBFBD><EFBFBD>ڴ棬<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Խ<EFBFBD>硣<EFBFBD><EFBFBD>vector<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֲ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȱ<EFBFBD>ݣ<EFBFBD>
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>൱<EFBFBD>ڿɷ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>չ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>飬<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʿ죬<EFBFBD><EFBFBD><EFBFBD>м<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɾ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ĩ<EFBFBD>˲<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɾ<EFBFBD><EFBFBD><EFBFBD>졣
|
||||
|
||||
<20>ĵ<EFBFBD><C4B5><EFBFBD><EFBFBD>ݲο<DDB2><CEBF><EFBFBD>
|
||||
https://www.cnblogs.com/aiguona/p/7228364.html
|
||||
* */
|
||||
int main() {
|
||||
vector<int> v; //<2F><><EFBFBD><EFBFBD>vector
|
||||
vector<int>::iterator it; //<2F><><EFBFBD><EFBFBD>һ<EFBFBD><D2BB>vector<6F><72><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
for (int i = 10; i >= 1; i--) //<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
v.push_back(i);
|
||||
|
||||
cout << "<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>";
|
||||
for (it = v.begin(); it != v.end(); it++) //<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֵ
|
||||
cout << *it << " ";
|
||||
cout << endl;
|
||||
|
||||
it -= 1;
|
||||
cout << "<EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֵΪ<EFBFBD><EFBFBD>" << *it << " " << endl;
|
||||
v.erase(it); //ɾ<><C9BE><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><D2BB>Ԫ<EFBFBD><D4AA>
|
||||
|
||||
cout << "Ԫ<EFBFBD>ظ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>" << v.size() << endl; //<2F><><EFBFBD><EFBFBD>Ԫ<EFBFBD>ظ<EFBFBD><D8B8><EFBFBD>
|
||||
sort(v.begin(), v.end()); //vector<6F><72><EFBFBD><EFBFBD>
|
||||
|
||||
cout << "<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>";
|
||||
for (it = v.begin(); it != v.end(); it++) //<2F><><EFBFBD><EFBFBD>vectorԪ<72><D4AA>
|
||||
cout << *it << " ";
|
||||
cout << endl;
|
||||
|
||||
v.insert(v.begin(), 100); //<2F><>posλ<73>ò<EFBFBD><C3B2><EFBFBD>һ<EFBFBD><D2BB>elem
|
||||
cout << "<EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD>Ԫ<EFBFBD><EFBFBD>Ϊ<EFBFBD><EFBFBD>" << v.front() << endl;//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><D2BB>Ԫ<EFBFBD><D4AA>
|
||||
|
||||
v.pop_back(); //ȥ<><C8A5><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><D2BB>Ԫ<EFBFBD><D4AA>
|
||||
cout << "Ԫ<EFBFBD>ظ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>" << v.size() << endl;//<2F><><EFBFBD><EFBFBD>Ԫ<EFBFBD>ظ<EFBFBD><D8B8><EFBFBD>
|
||||
|
||||
v.clear(); //vector<6F><72><EFBFBD><EFBFBD>
|
||||
cout << "<EFBFBD><EFBFBD><EFBFBD>պ<EFBFBD>Ԫ<EFBFBD>ظ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>" << v.size() << endl; //<2F><><EFBFBD><EFBFBD>Ԫ<EFBFBD>ظ<EFBFBD><D8B8><EFBFBD>
|
||||
return 0;
|
||||
}
|
||||
42
C++专题课程/STL基础知识/STL-4-pair模板.cpp
Normal file
42
C++专题课程/STL基础知识/STL-4-pair模板.cpp
Normal file
@@ -0,0 +1,42 @@
|
||||
#include<bits/stdc++.h>
|
||||
|
||||
using namespace std;
|
||||
|
||||
/*
|
||||
֪ʶ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݣ<EFBFBD>C++ STL pair<69><72><EFBFBD><EFBFBD>
|
||||
|
||||
pair<EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD>ģ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͣ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>а<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϳ<EFBFBD><EFBFBD>Բ<EFBFBD>ͬ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֵ<EFBFBD>Ļ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͬ<EFBFBD><EFBFBD><EFBFBD>ͣ<EFBFBD><EFBFBD>Ϳ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>鷵<EFBFBD>أ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Dz<EFBFBD>ͬ<EFBFBD><EFBFBD><EFBFBD>ͣ<EFBFBD><EFBFBD>Ϳ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Լ<EFBFBD>д<EFBFBD><EFBFBD>struct <20><>
|
||||
<EFBFBD><EFBFBD>Ϊ<EFBFBD>˷<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϳ<EFBFBD><EFBFBD><EFBFBD>ʹ<EFBFBD><EFBFBD> c++<2B>Դ<EFBFBD><D4B4><EFBFBD>pair <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><D2BB>pair,<2C><><EFBFBD>д<EFBFBD><D0B4><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֵ<EFBFBD><D6B5><EFBFBD><EFBFBD><EFBFBD>˷<EFBFBD><CBB7><EFBFBD>ֵ<EFBFBD><D6B5>Ӧ<EFBFBD>ã<EFBFBD><C3A3><EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ж<EFBFBD><D0B6><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ե<EFBFBD>ʱ<EFBFBD><CAB1> <20><>һ<EFBFBD><D2BB><EFBFBD>Լ<EFBFBD>дһ<D0B4><D2BB>struct <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ԵĻ<D4B5><C4BB><EFBFBD>
|
||||
<EFBFBD>Ϳ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>pair <20><><EFBFBD>в<EFBFBD><D0B2><EFBFBD><EFBFBD><EFBFBD>pair <20><><EFBFBD><EFBFBD>ʡ<EFBFBD><CAA1><EFBFBD>Լ<EFBFBD>дһ<D0B4><D2BB>struct .<2E><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ԵĻ<D4B5><C4BB><EFBFBD>
|
||||
<EFBFBD><EFBFBD>ʵҲ<EFBFBD>ǿ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>õ<EFBFBD>pair <20><> <20><><EFBFBD><EFBFBD><EFBFBD>˵<EFBFBD>д<EFBFBD><D0B4> pair <int ,pair<int ,int > >д<><D0B4><EFBFBD><EFBFBD><EFBFBD>ˡ<EFBFBD><CBA1><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ߵ<EFBFBD><DFB5><EFBFBD><EFBFBD><EFBFBD> > > Ҫ<>пո<D5B8><F1A3ACB7><EFBFBD><EFBFBD>ͻ<EFBFBD><CDBB><EFBFBD> >>λ<><CEBB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
<EFBFBD>ĵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݲο<EFBFBD><EFBFBD><EFBFBD>
|
||||
https://www.cnblogs.com/aiguona/p/7231377.html
|
||||
* */
|
||||
typedef pair<string, string> au; //<2F><><EFBFBD><EFBFBD>typedef<65><66><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
int main() {
|
||||
int flag;
|
||||
string x1, x2;
|
||||
pair<string, string> p1("a", "bc"); //<2F><><EFBFBD><EFBFBD>һ<EFBFBD><D2BB>pair<69><72><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ԫ<EFBFBD>طֱ<D8B7>Ϊstring<6E><67>string<6E><67><EFBFBD>ͣ<EFBFBD><CDA3><EFBFBD><EFBFBD><EFBFBD>first<73><74>Ա<EFBFBD><D4B1>ʼ<EFBFBD><CABC>Ϊ<EFBFBD><CEAA>a<EFBFBD><61><EFBFBD><EFBFBD><EFBFBD><EFBFBD>second<6E><64>Ա<EFBFBD><D4B1>ʼ<EFBFBD><CABC>Ϊ<EFBFBD><CEAA>ab<61><62>
|
||||
pair<string, string> p2("a", "aa");
|
||||
au p3;
|
||||
|
||||
string name;
|
||||
name = p1.second; //<2F><><EFBFBD><EFBFBD>1<EFBFBD><31><EFBFBD><EFBFBD>Ϊsecond<6E><64><EFBFBD><EFBFBD><EFBFBD>ݳ<EFBFBD>Ա
|
||||
cout << p1.first << endl;
|
||||
cout << name << endl;
|
||||
|
||||
flag = p1 < p2;
|
||||
cout << flag << endl; //<2F>ж<EFBFBD><D0B6><EFBFBD><EFBFBD><EFBFBD>pair<69><72><EFBFBD><EFBFBD><EFBFBD>Ĵ<EFBFBD>С<EFBFBD><D0A1><EFBFBD>ֵ<EFBFBD><D6B5><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
flag = p1 > p2;
|
||||
cout << flag << endl;
|
||||
|
||||
//<2F><><EFBFBD><EFBFBD> <20><> 8 James
|
||||
while (cin >> x1 >> x2) {
|
||||
p3 = make_pair(x1, x2); //<2F><><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD>µ<EFBFBD>pair<69><72><EFBFBD><EFBFBD>
|
||||
cout << p3.first << "****" << p3.second << endl;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
40
C++专题课程/STL基础知识/STL-5-set关联式容器.cpp
Normal file
40
C++专题课程/STL基础知识/STL-5-set关联式容器.cpp
Normal file
@@ -0,0 +1,40 @@
|
||||
#include<bits/stdc++.h>
|
||||
|
||||
using namespace std;
|
||||
|
||||
/*
|
||||
֪ʶ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݣ<EFBFBD>STL set<65><74><EFBFBD><EFBFBD>
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>set<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>˵<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>set<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʽ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> set<65><74>Ϊһ<CEAA><D2BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ҳ<EFBFBD><D2B2><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>洢ͬһ<CDAC><D2BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>͵<EFBFBD><CDB5><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͣ<EFBFBD>
|
||||
<20><><EFBFBD><EFBFBD><EFBFBD>ܴ<EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD><EFBFBD>ݼ<EFBFBD><DDBC><EFBFBD><EFBFBD><EFBFBD>ȡ<EFBFBD><C8A1><EFBFBD><EFBFBD><EFBFBD>ݣ<EFBFBD><DDA3><EFBFBD>set<65><74>ÿ<EFBFBD><C3BF>Ԫ<EFBFBD>ص<EFBFBD>ֵ<EFBFBD><D6B5>Ψһ<CEA8><D2BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ϵͳ<CFB5>ܸ<EFBFBD><DCB8><EFBFBD>Ԫ<EFBFBD>ص<EFBFBD>ֵ<EFBFBD>Զ<EFBFBD><D4B6><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
<EFBFBD>ĵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݲο<EFBFBD><EFBFBD><EFBFBD>
|
||||
https://www.cnblogs.com/aiguona/p/7231399.html
|
||||
* */
|
||||
int main() {
|
||||
int i;
|
||||
set<int> set1;
|
||||
for (i = 0; i < 10; ++i)
|
||||
set1.insert(i);
|
||||
|
||||
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
set<int>::iterator it;
|
||||
for (it = set1.begin(); it != set1.end(); it++)
|
||||
cout << *it << "\t";
|
||||
cout << endl;
|
||||
|
||||
//<2F><>3<EFBFBD><33><EFBFBD>뵽set1<74><31>,<2C><><EFBFBD><EFBFBD><EFBFBD>ɹ<EFBFBD><C9B9><EFBFBD>set1.insert(3).second<6E><64><EFBFBD><EFBFBD>1<EFBFBD><31><EFBFBD><EFBFBD><EFBFBD><EFBFBD>0.
|
||||
set1.erase(5);
|
||||
if (set1.insert(3).second)
|
||||
cout << "set insert success";
|
||||
else
|
||||
cout << "set insert failed";
|
||||
cout << endl;
|
||||
|
||||
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
set<int>::iterator itr;
|
||||
for (itr = set1.begin(); itr != set1.end(); itr++)
|
||||
cout << *itr << "\t";
|
||||
set1.clear();
|
||||
return 0;
|
||||
}
|
||||
29
C++专题课程/STL基础知识/STL-6-map键值对.cpp
Normal file
29
C++专题课程/STL基础知识/STL-6-map键值对.cpp
Normal file
@@ -0,0 +1,29 @@
|
||||
#include<bits/stdc++.h>
|
||||
|
||||
using namespace std;
|
||||
|
||||
/*
|
||||
֪ʶ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݣ<EFBFBD>STL map<61><70><EFBFBD><EFBFBD>
|
||||
|
||||
Map<EFBFBD><EFBFBD>STL<EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ṩһ<EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>е<EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Գ<EFBFBD>Ϊ<EFBFBD>ؼ<EFBFBD><EFBFBD>֣<EFBFBD>ÿ<EFBFBD><EFBFBD><EFBFBD>ؼ<EFBFBD><EFBFBD><EFBFBD>ֻ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>map<EFBFBD>г<EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD>Σ<EFBFBD><EFBFBD>ڶ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ܳ<EFBFBD>Ϊ<EFBFBD>ùؼ<EFBFBD><EFBFBD>ֵ<EFBFBD>ֵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݴ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ԣ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>п<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ǵ<EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD>ݵ<EFBFBD>ʱ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڱ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ṩ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͨ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
<EFBFBD>ĵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݲο<EFBFBD><EFBFBD><EFBFBD>
|
||||
https://www.cnblogs.com/aiguona/p/7231451.html
|
||||
|
||||
* */
|
||||
int main() {
|
||||
map<char, int> a;//<2F><><EFBFBD><EFBFBD>map<61><70><EFBFBD><EFBFBD>
|
||||
a.insert(map<char, int>::value_type('c', 1));//<2F><><EFBFBD><EFBFBD>Ԫ<EFBFBD><D4AA>
|
||||
a.insert(map<char, int>::value_type('d', 2));
|
||||
map<char, int>::iterator b = a.find('c');//<2F><><EFBFBD><EFBFBD>Ԫ<EFBFBD><D4AA>
|
||||
|
||||
map<char, int>::const_iterator it;
|
||||
for (it = a.begin(); it != a.end(); ++it)
|
||||
cout << it->first << "=" << it->second << endl;
|
||||
|
||||
cout << endl;
|
||||
|
||||
a.clear();//ɾ<><C9BE><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ԫ<EFBFBD><D4AA>
|
||||
return 0;
|
||||
}
|
||||
34
C++专题课程/STL基础知识/STL-7-list列表.cpp
Normal file
34
C++专题课程/STL基础知识/STL-7-list列表.cpp
Normal file
@@ -0,0 +1,34 @@
|
||||
#include<bits/stdc++.h>
|
||||
|
||||
using namespace std;
|
||||
|
||||
/*
|
||||
֪ʶ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݣ<EFBFBD>STL list<73><74><EFBFBD><EFBFBD>
|
||||
|
||||
list<EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʽ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>list<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɵĹ<EFBFBD><EFBFBD><EFBFBD>ʵ<EFBFBD><EFBFBD><EFBFBD>Ϻ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݽṹ<EFBFBD>е<EFBFBD>˫<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ǽ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ƶģ<EFBFBD>
|
||||
list<EFBFBD>е<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ԫ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͨ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ָ<EFBFBD>봮<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ϵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ա<EFBFBD><EFBFBD><EFBFBD>list<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD>˫<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>仹<EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>״˫<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֻ<EFBFBD><EFBFBD>Ҫһ<EFBFBD><EFBFBD>ָ<EFBFBD>룬<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>list<EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ҫ<EFBFBD><EFBFBD><EFBFBD>ʣ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>insert<EFBFBD><EFBFBD><EFBFBD>ͺϲ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>splice<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD>ԭ<EFBFBD>е<EFBFBD>list<73><74><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʧЧ<CAA7><D0A7><EFBFBD><EFBFBD><EFBFBD><EFBFBD> list<73><74>Ԫ<EFBFBD><D4AA>ɾ<EFBFBD><C9BE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>erase<73><65>Ҳֻ<D2B2>С<EFBFBD>ָ<EFBFBD><D6B8><EFBFBD><EFBFBD>ɾ<EFBFBD><C9BE>Ԫ<EFBFBD>ء<EFBFBD><D8A1><EFBFBD><EFBFBD>Ǹ<EFBFBD><C7B8><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʧЧ<CAA7><D0A7><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>κ<EFBFBD>Ӱ<EFBFBD>졣
|
||||
|
||||
<EFBFBD>ĵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݲο<EFBFBD><EFBFBD><EFBFBD>
|
||||
https://www.cnblogs.com/aiguona/p/7231609.html
|
||||
*/
|
||||
|
||||
using namespace std;
|
||||
|
||||
int main() {
|
||||
list<string> test;
|
||||
|
||||
test.push_back("back"); //back
|
||||
test.push_front("middle"); //middle back
|
||||
test.push_front("front"); //front middle back
|
||||
|
||||
cout << test.front() << endl; //front
|
||||
cout << *test.begin() << endl; //front
|
||||
|
||||
cout << test.back() << endl; //back
|
||||
cout << *(test.rbegin()) << endl; //back
|
||||
|
||||
test.pop_front(); //middle back
|
||||
test.pop_back(); //middle
|
||||
|
||||
cout << test.front() << endl; //middle
|
||||
}
|
||||
61
C++专题课程/STL基础知识/STL-8-双端队列.cpp
Normal file
61
C++专题课程/STL基础知识/STL-8-双端队列.cpp
Normal file
@@ -0,0 +1,61 @@
|
||||
#include<bits/stdc++.h>
|
||||
|
||||
using namespace std;
|
||||
|
||||
/*
|
||||
֪ʶ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݣ<EFBFBD>STL ˫<>˶<EFBFBD><CBB6><EFBFBD>deque<75><65><EFBFBD><EFBFBD>
|
||||
|
||||
Deque<EFBFBD><EFBFBD>˫<EFBFBD>˶<EFBFBD><EFBFBD>У<EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD>־<EFBFBD><EFBFBD>ж<EFBFBD><EFBFBD>к<EFBFBD>ջ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݽṹ<EFBFBD><EFBFBD>˫<EFBFBD>˶<EFBFBD><EFBFBD>е<EFBFBD>Ԫ<EFBFBD>ؿ<EFBFBD><EFBFBD>Դ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>˵<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɾ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڱ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>˽<EFBFBD><EFBFBD>С<EFBFBD>
|
||||
<EFBFBD>ĵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݲο<EFBFBD><EFBFBD><EFBFBD>
|
||||
https://www.cnblogs.com/aiguona/p/7281739.html
|
||||
*/
|
||||
|
||||
using namespace std;
|
||||
|
||||
int main() {
|
||||
deque<int> ideq(20); //Create a deque ideq with 20 elements of default value 0
|
||||
deque<int>::iterator pos;
|
||||
int i;
|
||||
|
||||
//<2F><>ֵ
|
||||
for (i = 0; i < 20; ++i)
|
||||
ideq[i] = i;
|
||||
|
||||
//<2F><><EFBFBD><EFBFBD>deque
|
||||
printf("<EFBFBD><EFBFBD><EFBFBD><EFBFBD>deque<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>:\n");
|
||||
for (i = 0; i < 20; ++i)
|
||||
printf("%d ", ideq[i]);
|
||||
putchar('\n');
|
||||
|
||||
//<2F><>ͷβ<CDB7><CEB2><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
printf("\n<EFBFBD><EFBFBD>ͷβ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>...\n");
|
||||
ideq.push_back(100);
|
||||
ideq.push_front(i);
|
||||
|
||||
//<2F><><EFBFBD><EFBFBD>deque
|
||||
printf("\n<EFBFBD><EFBFBD><EFBFBD><EFBFBD>deque<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>:\n");
|
||||
for (pos = ideq.begin(); pos != ideq.end(); pos++)
|
||||
printf("%d ", *pos);
|
||||
putchar('\n');
|
||||
|
||||
//<2F><><EFBFBD><EFBFBD>
|
||||
const int FINDNUMBER = 19;
|
||||
printf("\n<EFBFBD><EFBFBD><EFBFBD><EFBFBD>%d\n", FINDNUMBER);
|
||||
pos = find(ideq.begin(), ideq.end(), FINDNUMBER);
|
||||
if (pos != ideq.end()) {
|
||||
printf("find %d success\n", *pos);
|
||||
} else
|
||||
printf("find failed\n");
|
||||
|
||||
//<2F><>ͷβɾ<CEB2><C9BE><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
printf("\n<EFBFBD><EFBFBD>ͷβɾ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>...\n");
|
||||
ideq.pop_back();
|
||||
ideq.pop_front();
|
||||
|
||||
//<2F><><EFBFBD><EFBFBD>deque
|
||||
printf("\n<EFBFBD><EFBFBD><EFBFBD><EFBFBD>deque<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>:\n");
|
||||
for (pos = ideq.begin(); pos != ideq.end(); pos++)
|
||||
printf("%d ", *pos);
|
||||
putchar('\n');
|
||||
return 0;
|
||||
}
|
||||
33
C++专题课程/STL基础知识/STL-9-Binary search详解.cpp
Normal file
33
C++专题课程/STL基础知识/STL-9-Binary search详解.cpp
Normal file
@@ -0,0 +1,33 @@
|
||||
#include<bits/stdc++.h>
|
||||
|
||||
using namespace std;
|
||||
|
||||
/*
|
||||
֪ʶ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݣ<EFBFBD>STL Binary search<63><68><EFBFBD><EFBFBD>
|
||||
|
||||
<EFBFBD><EFBFBD>ǰ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֵ<EFBFBD><EFBFBD><EFBFBD>Ŀ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֶ<EFBFBD>ʵ<EFBFBD>ֶ<EFBFBD><EFBFBD>֣<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ò<EFBFBD>˵<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ƚ϶࣬<EFBFBD><EFBFBD><EFBFBD>ڷ<EFBFBD><EFBFBD><EFBFBD>ֵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ҿ<EFBFBD><EFBFBD>Ⱥ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>׳<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ⷢ<EFBFBD><EFBFBD>ֱ<EFBFBD><EFBFBD>ʹ<EFBFBD><EFBFBD>STL<EFBFBD>еĶ<EFBFBD><EFBFBD>ֺ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݻ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>û<EFBFBD>нӴ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͬѧ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֺ<EFBFBD><EFBFBD><EFBFBD>ȷʵ<EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD>ͷ<EFBFBD>۵IJ<EFBFBD><EFBFBD>֣<EFBFBD>
|
||||
<EFBFBD>Լ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>е<EFBFBD><EFBFBD>ң<EFBFBD><EFBFBD>Ҳ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʹ<EFBFBD>÷<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>б<EFBFBD>Ҫ<EFBFBD>Լ<EFBFBD><EFBFBD>ܽ<EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ժ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>á<EFBFBD>
|
||||
|
||||
<20>ĵ<EFBFBD><C4B5><EFBFBD><EFBFBD>ݲο<DDB2><CEBF><EFBFBD>
|
||||
https://www.cnblogs.com/aiguona/p/7281856.html
|
||||
*/
|
||||
|
||||
using namespace std;
|
||||
|
||||
int main()
|
||||
{
|
||||
int a[100]= {4,10,11,30,69,70,96,100};
|
||||
int b=binary_search(a,a+9,4);//<2F><><EFBFBD>ҳɹ<D2B3><C9B9><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>1
|
||||
cout<<"<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>в<EFBFBD><EFBFBD><EFBFBD>Ԫ<EFBFBD><EFBFBD>4<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϊ<EFBFBD><EFBFBD>"<<b<<endl;
|
||||
int c=binary_search(a,a+9,40);//<2F><><EFBFBD><EFBFBD>ʧ<EFBFBD>ܣ<EFBFBD><DCA3><EFBFBD><EFBFBD><EFBFBD>0
|
||||
cout<<"<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>в<EFBFBD><EFBFBD><EFBFBD>Ԫ<EFBFBD><EFBFBD>40<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϊ<EFBFBD><EFBFBD>"<<b<<endl;
|
||||
int d=lower_bound(a,a+9,10)-a;
|
||||
cout<<"<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>в<EFBFBD><EFBFBD>ҵ<EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڵ<EFBFBD><EFBFBD><EFBFBD>10<EFBFBD><EFBFBD>Ԫ<EFBFBD><EFBFBD>λ<EFBFBD>ã<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϊ<EFBFBD><EFBFBD>"<<d<<endl;
|
||||
int e=lower_bound(a,a+9,101)-a;
|
||||
cout<<"<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>в<EFBFBD><EFBFBD>ҵ<EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڵ<EFBFBD><EFBFBD><EFBFBD>101<EFBFBD><EFBFBD>Ԫ<EFBFBD><EFBFBD>λ<EFBFBD>ã<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϊ<EFBFBD><EFBFBD>"<<e<<endl;
|
||||
int f=upper_bound(a,a+9,10)-a;
|
||||
cout<<"<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>в<EFBFBD><EFBFBD>ҵ<EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>10<EFBFBD><EFBFBD>Ԫ<EFBFBD><EFBFBD>λ<EFBFBD>ã<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϊ<EFBFBD><EFBFBD>"<<f<<endl;
|
||||
int g=upper_bound(a,a+9,101)-a;
|
||||
cout<<"<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>в<EFBFBD><EFBFBD>ҵ<EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>101<EFBFBD><EFBFBD>Ԫ<EFBFBD><EFBFBD>λ<EFBFBD>ã<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϊ<EFBFBD><EFBFBD>"<<g<<endl;
|
||||
}
|
||||
BIN
C++专题课程/STL基础知识/gmon.out
Normal file
BIN
C++专题课程/STL基础知识/gmon.out
Normal file
Binary file not shown.
0
C++专题课程/STL基础知识/set操作基础/.keep
Normal file
0
C++专题课程/STL基础知识/set操作基础/.keep
Normal file
30
C++专题课程/STL基础知识/set操作基础/set的使用_1.cpp
Normal file
30
C++专题课程/STL基础知识/set操作基础/set的使用_1.cpp
Normal file
@@ -0,0 +1,30 @@
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
int main() {
|
||||
set<int>s;
|
||||
int n;
|
||||
cin>>n;
|
||||
for(int i=1; i<=n; i++) {
|
||||
int x;
|
||||
cin>>x;
|
||||
s.insert (x);
|
||||
}
|
||||
set<int>::iterator it;
|
||||
for(it=s.begin (); it!=s.end (); it++) {
|
||||
printf("%d\n",*it);
|
||||
}
|
||||
|
||||
//s.end()û<><C3BB>ֵ
|
||||
cout<<"s.begin() "<<*s.begin ()<<endl;
|
||||
//lower_bound()--<2D><><EFBFBD><EFBFBD>ָ<EFBFBD><D6B8><EFBFBD><EFBFBD><EFBFBD>ڣ<EFBFBD><DAA3><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڣ<EFBFBD>ijֵ<C4B3>ĵ<EFBFBD>һ<EFBFBD><D2BB>Ԫ<EFBFBD>صĵ<D8B5><C4B5><EFBFBD><EFBFBD><EFBFBD>
|
||||
cout<<"lower_buond 3 "<<*s.lower_bound (3)<<endl;
|
||||
|
||||
//upper_bound()--<2D><><EFBFBD>ش<EFBFBD><D8B4><EFBFBD>ij<EFBFBD><C4B3>ֵԪ<D6B5>صĵ<D8B5><C4B5><EFBFBD><EFBFBD><EFBFBD>
|
||||
cout<<"upper_bound 3 "<<*s.upper_bound (3)<<endl;
|
||||
|
||||
//find()--<2D><><EFBFBD><EFBFBD>һ<EFBFBD><D2BB>ָ<EFBFBD><EFBFBD><F2B1BBB2>ҵ<EFBFBD>Ԫ<EFBFBD>صĵ<D8B5><C4B5><EFBFBD><EFBFBD><EFBFBD>
|
||||
cout<<"find() 3 "<<*s.find (3)<<endl;
|
||||
|
||||
cout<<"s.size() "<<s.size ()<<endl;
|
||||
return 0;
|
||||
}
|
||||
21
C++专题课程/STL基础知识/set操作基础/set的使用_2.cpp
Normal file
21
C++专题课程/STL基础知识/set操作基础/set的使用_2.cpp
Normal file
@@ -0,0 +1,21 @@
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
int main() {
|
||||
set<int> s;
|
||||
s.insert(1);
|
||||
s.insert(2);
|
||||
s.insert(3);
|
||||
s.insert(1);
|
||||
cout<<"set <20><> size ֵΪ <20><>"<<s.size()<<endl;
|
||||
cout<<"set <20><> maxsize<7A><65>ֵΪ <20><>"<<s.max_size()<<endl;
|
||||
cout<<"set <20>еĵ<D0B5>һ<EFBFBD><D2BB>Ԫ<EFBFBD><D4AA><EFBFBD><EFBFBD> <20><>"<<*s.begin()<<endl;
|
||||
cout<<"set <20>е<EFBFBD><D0B5><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><D2BB>Ԫ<EFBFBD><D4AA><EFBFBD><EFBFBD>:"<<*s.end()<<endl;
|
||||
s.clear();
|
||||
if(s.empty()) {
|
||||
cout<<"set Ϊ<><CEAA> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>"<<endl;
|
||||
}
|
||||
cout<<"set <20><> size ֵΪ <20><>"<<s.size()<<endl;
|
||||
cout<<"set <20><> maxsize<7A><65>ֵΪ <20><>"<<s.max_size()<<endl;
|
||||
return 0;
|
||||
}
|
||||
|
||||
12
C++专题课程/STL基础知识/set操作基础/set的使用_3.cpp
Normal file
12
C++专题课程/STL基础知识/set操作基础/set的使用_3.cpp
Normal file
@@ -0,0 +1,12 @@
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
int main() {
|
||||
set<int> s;
|
||||
s.insert(1);
|
||||
s.insert(2);
|
||||
s.insert(3);
|
||||
s.insert(1);
|
||||
cout<<"set <20><> 1 <20><><EFBFBD>ֵĴ<D6B5><C4B4><EFBFBD><EFBFBD><EFBFBD> <20><>"<<s.count(1)<<endl;
|
||||
cout<<"set <20><> 4 <20><><EFBFBD>ֵĴ<D6B5><C4B4><EFBFBD><EFBFBD><EFBFBD> <20><>"<<s.count(4)<<endl;
|
||||
return 0;
|
||||
}
|
||||
18
C++专题课程/STL基础知识/set操作基础/set的使用_4.cpp
Normal file
18
C++专题课程/STL基础知识/set操作基础/set的使用_4.cpp
Normal file
@@ -0,0 +1,18 @@
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
int main() {
|
||||
set<int> s;
|
||||
set<int>::iterator iter;
|
||||
for(int i = 1 ; i <= 5; ++i) {
|
||||
s.insert(i);
|
||||
}
|
||||
for(iter = s.begin() ; iter != s.end() ; ++iter) {
|
||||
cout<<*iter<<" ";
|
||||
}
|
||||
cout<<endl;
|
||||
pair<set<int>::const_iterator,set<int>::const_iterator> pr;
|
||||
pr = s.equal_range(3);
|
||||
cout<<"<EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڵ<EFBFBD><EFBFBD><EFBFBD> 3 <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><>"<<*pr.first<<endl;
|
||||
cout<<"<EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 3<><33><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><> "<<*pr.second<<endl;
|
||||
return 0;
|
||||
}
|
||||
27
C++专题课程/STL基础知识/set操作基础/set的使用_5.cpp
Normal file
27
C++专题课程/STL基础知识/set操作基础/set的使用_5.cpp
Normal file
@@ -0,0 +1,27 @@
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
int main() {
|
||||
set<int> s;
|
||||
set<int>::const_iterator iter;
|
||||
set<int>::iterator first;
|
||||
set<int>::iterator second;
|
||||
for(int i = 1 ; i <= 10 ; ++i) {
|
||||
s.insert(i);
|
||||
}
|
||||
//<2F><>һ<EFBFBD><D2BB>ɾ<EFBFBD><C9BE>
|
||||
s.erase(s.begin());
|
||||
//<2F>ڶ<EFBFBD><DAB6><EFBFBD>ɾ<EFBFBD><C9BE>
|
||||
first = s.begin();
|
||||
second = s.begin();
|
||||
second++;
|
||||
second++;
|
||||
s.erase(first,second);
|
||||
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɾ<EFBFBD><C9BE>
|
||||
s.erase(8);
|
||||
cout<<"ɾ<EFBFBD><EFBFBD><EFBFBD><EFBFBD> set <20><>Ԫ<EFBFBD><D4AA><EFBFBD><EFBFBD> <20><>";
|
||||
for(iter = s.begin() ; iter != s.end() ; ++iter) {
|
||||
cout<<*iter<<" ";
|
||||
}
|
||||
cout<<endl;
|
||||
return 0;
|
||||
}
|
||||
13
C++专题课程/STL基础知识/set操作基础/set的使用_6.cpp
Normal file
13
C++专题课程/STL基础知识/set操作基础/set的使用_6.cpp
Normal file
@@ -0,0 +1,13 @@
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
int main()
|
||||
{
|
||||
int a[] = {1,2,3};
|
||||
set<int> s(a,a+3);
|
||||
set<int>::iterator iter;
|
||||
if((iter = s.find(2)) != s.end())
|
||||
{
|
||||
cout<<*iter<<endl;//<2F><><EFBFBD><EFBFBD>Ϊ2
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
18
C++专题课程/STL基础知识/set操作基础/set的使用_7.cpp
Normal file
18
C++专题课程/STL基础知识/set操作基础/set的使用_7.cpp
Normal file
@@ -0,0 +1,18 @@
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
int main() {
|
||||
int a[] = {1,2,3};
|
||||
set<int> s;
|
||||
set<int>::iterator iter;
|
||||
s.insert(a,a+3);
|
||||
for(iter = s.begin() ; iter != s.end() ; ++iter) {
|
||||
cout<<*iter<<" ";
|
||||
}
|
||||
cout<<endl;
|
||||
pair<set<int>::iterator,bool> pr;
|
||||
pr = s.insert(5);
|
||||
if(pr.second) {
|
||||
cout<<*pr.first<<endl;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
44
C++专题课程/STL基础知识/数组排序去重.cpp
Normal file
44
C++专题课程/STL基础知识/数组排序去重.cpp
Normal file
@@ -0,0 +1,44 @@
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
|
||||
//<2F><><EFBFBD>鳤<EFBFBD><E9B3A4>
|
||||
const int n=10;
|
||||
|
||||
/*
|
||||
<EFBFBD><EFBFBD><EFBFBD>ܣ<EFBFBD><EFBFBD><EFBFBD>ӡһά<EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
<EFBFBD><EFBFBD><EFBFBD>ߣ<EFBFBD><EFBFBD>ƺ<EFBFBD>
|
||||
ʱ<EFBFBD>䣺2019-10-29
|
||||
*/
|
||||
void printArray(int a[n]) {
|
||||
for (int i = 0; i < n; i++) {
|
||||
cout << a[i] << " ";
|
||||
}
|
||||
cout<<endl;
|
||||
}
|
||||
|
||||
int main() {
|
||||
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
int a[n] = { 0, 7, 7, 6, 1, 1, 5, 5, 8, 9 };
|
||||
|
||||
//<2F><><EFBFBD>鳤<EFBFBD><E9B3A4>
|
||||
int length= (sizeof(a) / sizeof(a[0]));
|
||||
|
||||
//ȥ<><C8A5>ǰ<EFBFBD><C7B0>ӡ<EFBFBD><D3A1><EFBFBD><EFBFBD>
|
||||
printArray(a);
|
||||
|
||||
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȥ<EFBFBD><C8A5>(<28><>С<EFBFBD><D0A1><EFBFBD><EFBFBD>:less<73><73><EFBFBD>ɴ<EFBFBD><C9B4><EFBFBD>С<EFBFBD><D0A1>greater)
|
||||
sort(a, a + n, less<int>() );
|
||||
|
||||
//<2F><>ʼȥ<CABC><C8A5>
|
||||
int n = unique(a, a + length) - a;
|
||||
|
||||
//<2F><><EFBFBD><EFBFBD>ȥ<EFBFBD>غ<EFBFBD><D8BA><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
for (int i = 0; i < n; i++)
|
||||
{
|
||||
cout << a[i] << " ";
|
||||
}
|
||||
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
84
C++专题课程/STL基础知识/键值对使用.cpp
Normal file
84
C++专题课程/STL基础知识/键值对使用.cpp
Normal file
@@ -0,0 +1,84 @@
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
|
||||
/*
|
||||
<EFBFBD><EFBFBD><EFBFBD>ܣ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ӡmap
|
||||
<EFBFBD><EFBFBD><EFBFBD>ߣ<EFBFBD><EFBFBD>ƺ<EFBFBD>
|
||||
ʱ<EFBFBD>䣺2019-10-29
|
||||
*/
|
||||
void printMap(map<int, int> _map) {
|
||||
map<int, int>::iterator iter = _map.begin();
|
||||
for (; iter != _map.end(); iter++) {
|
||||
cout << iter->first << ' ' << iter->second << endl;
|
||||
}
|
||||
cout << endl;
|
||||
}
|
||||
/*
|
||||
<EFBFBD><EFBFBD><EFBFBD>ܣ<EFBFBD><EFBFBD>ж<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Dz<EFBFBD><EFBFBD>Ǵ<EFBFBD><EFBFBD><EFBFBD>map<EFBFBD><EFBFBD>
|
||||
<EFBFBD><EFBFBD><EFBFBD>ߣ<EFBFBD><EFBFBD>ƺ<EFBFBD>
|
||||
ʱ<EFBFBD>䣺2019-10-29
|
||||
*/
|
||||
bool isExist(map<int, int> _map, int a) {
|
||||
map<int, int>::iterator iter = _map.find(a);
|
||||
if (iter != _map.end()) {
|
||||
return 1;
|
||||
}
|
||||
else {
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
/*
|
||||
<EFBFBD><EFBFBD><EFBFBD>ܣ<EFBFBD><EFBFBD><EFBFBD>map<EFBFBD><EFBFBD>ɾ<EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD>Ԫ<EFBFBD><EFBFBD>
|
||||
<EFBFBD><EFBFBD><EFBFBD>ߣ<EFBFBD><EFBFBD>ƺ<EFBFBD>
|
||||
ʱ<EFBFBD>䣺2019-10-29
|
||||
*/
|
||||
void deleteMapByKey(map<int, int>& _map, int a) { //ע<><D7A2><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>&<26><>ʾ<EFBFBD><CABE><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʵ<EFBFBD><CAB5> ,<2C><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ı<EFBFBD>ʵ<EFBFBD>ε<EFBFBD>ֵ
|
||||
//<2F><><EFBFBD>ݼ<EFBFBD>ֵɾ<D6B5><C9BE>
|
||||
_map.erase(a);
|
||||
}
|
||||
|
||||
/*
|
||||
<EFBFBD><EFBFBD><EFBFBD>ܣ<EFBFBD><EFBFBD><EFBFBD>map<EFBFBD>е<EFBFBD>һ<EFBFBD><EFBFBD>Ԫ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
<EFBFBD><EFBFBD><EFBFBD>ߣ<EFBFBD><EFBFBD>ƺ<EFBFBD>
|
||||
ʱ<EFBFBD>䣺2019-10-29
|
||||
*/
|
||||
void updateForMap(map<int, int>& _map, int key, int value) { //ע<><D7A2><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>&<26><>ʾ<EFBFBD><CABE><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʵ<EFBFBD><CAB5> ,<2C><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ı<EFBFBD>ʵ<EFBFBD>ε<EFBFBD>ֵ
|
||||
map<int, int>::iterator iter = _map.find(key);
|
||||
if (iter != _map.end()) {
|
||||
iter->second = value;
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
int main() {
|
||||
|
||||
//<2F>ֵ<EFBFBD>map
|
||||
map<int, int> _map;
|
||||
|
||||
//<2F><><EFBFBD><EFBFBD>Ԫ<EFBFBD><D4AA>
|
||||
for (int i = 1; i <= 10; i++) {
|
||||
pair<int, int> value(i, i);
|
||||
_map.insert(value);
|
||||
}
|
||||
|
||||
//<2F><>ӡ<EFBFBD>Dz<EFBFBD><C7B2>Ǵ<EFBFBD><C7B4><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>3
|
||||
cout << "<EFBFBD>Ƿ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>3<EFBFBD><EFBFBD>" << isExist(_map, 3) << endl;
|
||||
|
||||
//<2F><><EFBFBD><EFBFBD>ɾ<EFBFBD><C9BE>Ԫ<EFBFBD><D4AA>3
|
||||
deleteMapByKey(_map, 3);
|
||||
|
||||
//<2F>ٴδ<D9B4>ӡ<EFBFBD>Dz<EFBFBD><C7B2>Ǵ<EFBFBD><C7B4><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>3
|
||||
cout << "<EFBFBD>Ƿ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>3<EFBFBD><EFBFBD>" << isExist(_map, 3) << endl;
|
||||
|
||||
//<2F><><EFBFBD><EFBFBD>map
|
||||
cout << "Ԫ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ǰ<EFBFBD><EFBFBD>map" << endl;
|
||||
printMap(_map);
|
||||
//<2F><EFBFBD><DEB8><EFBFBD><EFBFBD><EFBFBD>
|
||||
updateForMap(_map, 6, 10);
|
||||
//<2F><><EFBFBD><EFBFBD>map
|
||||
cout << "Ԫ<EFBFBD><EFBFBD><EFBFBD>ĺ<EFBFBD><EFBFBD><EFBFBD>map" << endl;
|
||||
printMap(_map);
|
||||
|
||||
return 0;
|
||||
}
|
||||
Reference in New Issue
Block a user