剔除list中相同的結構體數據，有三個思路：
1、兩層循環，逐個比較

2、使用set容器來剔除

3、使用unique方法去重

1. // deduplication.cpp : 定義控制臺應用程序的入口點。
2. //
3. #include <list>
4. #include <set>
5. #include <iostream>
6. #include <algorithm>
7. #include <vector>
8. #include <tchar.h>
9. using namespace std;
11. struct tagRecentGameItem
12. {
13. std::wstring strGameCode;
14. std::wstring strServerID;
15. __int64 nTime;
16. tagRecentGameItem()
17. : strGameCode(L"")
18. , strServerID(L"")
19. , nTime(0)
20. {
21. }
23. bool operator < (const tagRecentGameItem& right) const
24. {
25. if (this->nTime > right.nTime)
26. {
27. return true;
28. }
29. if (this->nTime == right.nTime)
30. {
31. //compare函數在>時返回1，<時返回-1，==時返回0
32. return this->strGameCode.compare(right.strGameCode) < 0;
33. }
34. return false;
35. }
36. bool operator == (const tagRecentGameItem& right) const
37. {
38. bool bEqual = false;
39. //_tcsicmp不區分大小寫，wcscmp區分大小寫
40. bEqual = ( 0 == _tcsicmp(this->strGameCode.c_str(), right.strGameCode.c_str()) );
41. bEqual &= ( 0 == _tcsicmp(this->strServerID.c_str(), right.strServerID.c_str()) );
42. return bEqual;
43. }
44. };
45. //
46. typedef std::list<tagRecentGameItem> listRecentGame;
47. typedef std::set<tagRecentGameItem> setRecentGame;
48. //
49. listRecentGame m_LocalList;
50. listRecentGame m_RemoteList;
51. setRecentGame m_setGames;
53. //打印結果
54. void print_result(listRecentGame& items)
55. {
56. listRecentGame::iterator iter = items.begin();
57. for (iter; iter!=items.end(); ++iter)
58. {
59. printf("gameCode: %ls\n", iter->strGameCode.c_str());
60. }
61. printf("\n");
62. }
63. //逐個比較
64. void deduplication1(listRecentGame& items)
65. {
66. printf("method :deduplication1\n");
68. items.sort();//需要重載操作符<
69. listRecentGame::iterator itrB = items.begin();
70. listRecentGame::iterator itrE = items.end();
71. listRecentGame::iterator itr;
72. for (itrB; itrB != itrE; ++itrB)
73. {
74. itr = itrB;
75. ++itr;
76. for(itr; itr != itrE;)
77. {
78. if (*itr == *itrB)
79. {
80. items.erase(itr++);
81. }
82. else
83. {
84. ++itr;
85. }
86. }
87. }
89. //打印結果
90. print_result(items);
91. }
92. //利用set容器特性去重
93. void deduplication2(listRecentGame& items)
94. {
95. printf("method :deduplication2\n");
97. listRecentGame::iterator iter1 = items.begin();
98. listRecentGame::iterator iter2 = items.end();
99. for (iter1; iter1 != iter2; ++iter1)
100. {
101. //需要重載操作符<
102. m_setGames.insert(*iter1);
103. }
105. //再寫回list
106. items.clear();
107. setRecentGame::iterator pos = m_setGames.begin();
108. for (pos; pos!=m_setGames.end(); ++pos)
109. {
110. items.push_back(*pos);
111. }
113. //打印結果
114. print_result(items);
115. }
116. //stl的unique方法去重
117. void deduplication3(listRecentGame& items)
118. {
119. printf("method :deduplication3\n");
121. //unique函數功能是去除相鄰的重復元素,註意是相鄰,所以必須先使用sort函數。
122. items.sort();
123. //unique必須重載==操作符
124. listRecentGame::iterator new_end = unique(items.begin(), items.end());
125. items.erase(new_end, items.end());
127. //打印結果
128. print_result(items);
129. }
130. //
131. int _tmain(int argc, _TCHAR* argv[])
132. {
133. //裝載本地記錄
134. tagRecentGameItem item;
135. memset(&item, 0, sizeof(item));
136. item.strGameCode = L"abc";
137. item.strServerID = L"s31";
138. item.nTime = 20160501183417;
139. m_LocalList.push_back(item);
141. memset(&item, 0, sizeof(item));
142. item.strGameCode = L"bcd";
143. item.strServerID = L"s32";
144. item.nTime = 20160501183418;
145. m_LocalList.push_back(item);
147. memset(&item, 0, sizeof(item));
148. item.strGameCode = L"cde";
149. item.strServerID = L"s33";
150. item.nTime = 20160501183419;
151. m_LocalList.push_back(item);
153. memset(&item, 0, sizeof(item));
154. item.strGameCode = L"def";
155. item.strServerID = L"s34";
156. item.nTime = 20160501183420;
157. m_RemoteList.push_back(item);
159. //裝載遠程記錄
160. memset(&item, 0, sizeof(item));
161. item.strGameCode = L"abc";
162. item.strServerID = L"s31";
163. item.nTime = 20160501183417;
164. m_RemoteList.push_back(item);
166. memset(&item, 0, sizeof(item));
167. item.strGameCode = L"bcd";
168. item.strServerID = L"s32";
169. item.nTime = 20160501183418;
170. m_RemoteList.push_back(item);
172. memset(&item, 0, sizeof(item));
173. item.strGameCode = L"cde";
174. item.strServerID = L"s33";
175. item.nTime = 20160501183419;
176. m_RemoteList.push_back(item);
178. memset(&item, 0, sizeof(item));
179. item.strGameCode = L"def0";
180. item.strServerID = L"s34";
181. item.nTime = 20160501183420;
182. m_RemoteList.push_back(item);
184. //合並到一個list
185. m_LocalList.insert(m_LocalList.begin(), m_RemoteList.begin(), m_RemoteList.end());
187. deduplication1(m_LocalList);
188. deduplication2(m_LocalList);
189. deduplication3(m_LocalList);
191. system("pause");
193. return 0;
194. }

運行結果：

需要註意的地方：

STL中的排序都是默認使用小於號來排序。因此，在對結構體排序時，我們就需要重載小於號！比如：set容器在執行insert操作時，必須重載操作符<。另外，unique函數功能是去除相鄰的重復元素，而在執行unique操作時必須重載操作符==。

https://blog.csdn.net/hellokandy/article/details/51333942

剔除list中相同的結構體數據