合并算法_相近点合并算法-优快云博客

这个博客主要展示了C++代码实现检查并合并相同字符串的算法，通过`IsEqual`函数比较字符串并消除重复。在循环中，程序遍历列表并合并相同的元素，最后计算运行时间来评估效率。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

// MergeTest.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include <vector>
#include <list>
#include <string>
//#include <stdio>
#include <iosfwd>

#include <windows.h>

using namespace std;

bool IsEqual(const string& a,const string& b)
{
	int nlen = a.length();
	for (int i = 0; i < nlen; ++i)
	{
		int jjlen = b.length();
		for (int jj = 0; jj < jjlen; ++jj)
		{
			if (a[i] != b[jj])
			{
				return false;
			}
		}
	}
	return true;
}

int main()
{
	list<string> strList;
	for (int i = 0; i < 500; ++i)
	{
		strList.push_back("c");
		strList.push_back("a");
		strList.push_back("b");
		strList.push_back("a");
		strList.push_back("a");
		strList.push_back("b");
		strList.push_back("b");
		strList.push_back("c");
		strList.push_back("a");
		strList.push_back("d");
	}

	DWORD time_start, time_end;
	time_start = GetTickCount();

	auto curIt = strList.begin();
	for (; curIt != strList.end(); ++curIt)
	{
		while (true)
		{
			bool added = false;
			auto nextIt = curIt;
			++nextIt;
			for (; nextIt != strList.end(); ++nextIt)
			{
				if (IsEqual(*curIt,*nextIt))
				{
					(*curIt) += (*nextIt);
					strList.erase(nextIt);
					added = true;
					break;
				}
			}
			if (added == false)break;
		}
	}

	time_end = GetTickCount();

	double runTime = (time_end - time_start) / 1000.0;

	return 0;
}