'commit'

C++专题课程/STL基础知识/数组排序去重.cpp

@@ -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;
+}
+