代码染色！

最新推荐文章于 2024-04-20 09:39:58 发布

JarjingX

最新推荐文章于 2024-04-20 09:39:58 发布

阅读量1.2k

点赞数 1

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/JarjingX/article/details/53954966

本文深入探讨了代码染色这一编程辅助工具，通过不同颜色高亮代码段，提升代码可读性和调试效率。了解其原理及在各种编辑器中的应用。

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

// KMP 算法
#include<cstdio>
#include <windows.h>

int n, m, pos, pi[102];
char p[102], t[150002];
char file[30] = "..\\output\\output_ .txt";

int Compute_Prefix_Function( );
int KMP_Match( );

int main( )
{
	freopen( "..\\input\\input.txt", "r", stdin );

	LARGE_INTEGER nFreq;
    LARGE_INTEGER nBeginTime;
    LARGE_INTEGER nEndTime;
	double time1, time2;

	for( int num = 1; num <= 5; num++ )
	{
		scanf( "%d%d", &n, &m );
		scanf( "%s%s", t+1, p+1 );
		file[17] = 48 + num;

		freopen( file, "a", stdout );

		QueryPerformanceFrequency( &nFreq );

		QueryPerformanceCounter( &nBeginTime );
		Compute_Prefix_Function( );
		QueryPerformanceCounter(&nEndTime);
		time1=(double)(nEndTime.QuadPart-nBeginTime.QuadPart)/(double)nFreq.QuadPart * 1000000;

		QueryPerformanceCounter( &nBeginTime );
		pos = KMP_Match( );
		QueryPerformanceCounter(&nEndTime);
		time2=(double)(nEndTime.QuadPart-nBeginTime.QuadPart)/(double)nFreq.QuadPart * 1000000;

		printf( "KMP:\n" );
		printf( "		first match position:  %d\n", pos );
		printf( "		time for pretreatment: %.3lf\n", time1 );
		printf( "		time for first match:  %.3lf\n", time2 );
		printf( "\n" );

		fclose( stdout );

	}
}

int Compute_Prefix_Function( )
{
	pi[1] = 0;
	int k = 0;
	for( int q = 2; q <= m; q++ )
	{
		while( k > 0 && p[k+1] != p[q] ) k = pi[k];
		if( p[k+1] == p[q] ) k++;
		pi[q] = k;
	}
}

int KMP_Match( )
{
	int q = 0;
	for( int i = 1; i <= n; i++ )
	{
		while( q > 0 && p[q+1] != t[i] ) q = pi[q];
		if( p[q+1] == t[i] ) q = q + 1;
		if( q == m )
			return( i - m + 1 );
	}
	return -1;
}

// Rabin Karp 算法
#include<cstdio>
#include <windows.h>
#define prime 11117
#define d 17

int n, m, h, pos, phash, thash;
char p[102], t[150002];
char file[30] = "..\\output\\output_ .txt";

int Pretreatment( );
int Rabin_Karp_Match( );

int main( )
{
	freopen( "..\\input\\input.txt", "r", stdin );

	LARGE_INTEGER nFreq;
    LARGE_INTEGER nBeginTime;
    LARGE_INTEGER nEndTime;
	double time1, time2;

	for( int num = 1; num <= 5; num++ )
	{
		scanf( "%d%d", &n, &m );
		scanf( "%s%s", t+1, p+1 );
		file[17] = 48 + num;

		freopen( file, "a", stdout );

		QueryPerformanceFrequency( &nFreq );

		QueryPerformanceCounter( &nBeginTime );
		Pretreatment( );
		QueryPerformanceCounter(&nEndTime);
		time1=(double)(nEndTime.QuadPart-nBeginTime.QuadPart)/(double)nFreq.QuadPart * 1000000;

		QueryPerformanceCounter( &nBeginTime );
		pos = Rabin_Karp_Match( );
		QueryPerformanceCounter(&nEndTime);
		time2=(double)(nEndTime.QuadPart-nBeginTime.QuadPart)/(double)nFreq.QuadPart * 1000000;

		printf( "Rabin Karp:\n" );
		printf( "		first match position:  %d\n", pos );
		printf( "		time for pretreatment: %.3lf\n", time1 );
		printf( "		time for first match:  %.3lf\n", time2 );
		printf( "\n" );

		fclose( stdout );

	}
}

int Pretreatment( )
{
	int c;
	h = 1;
	for( int i = m; i; i-- )
	{
		phash = ( phash + h * p[i] ) % prime;
		thash = ( thash + h * t[i] ) % prime;
		h = ( h * d ) % prime;
	}
}

int Rabin_Karp_Match( )
{
	int c;
	for( int i = 1; i <= n-m+1; i++ )
	{
		if( phash == thash )
		{
			int j = 1;
			while( j <= m && p[j] == t[i+j-1] ) j++;
			if( j == m+1 ) return i;
		}
		if( i <= n-m )
			thash = ( d*( thash - h * t[i] ) + t[i+m] + prime ) % prime;
	}
	return -1;
}

// Quick_Search 算法
#include<cstdio>
#include <windows.h>

int n, m, pos, Bc[302];
char p[102], t[150002];
char file[30] = "..\\output\\output_ .txt";

int Compute_Pre_Bc( );
int Quick_Search( );

int main( )
{
	freopen( "..\\input\\input.txt", "r", stdin );

	LARGE_INTEGER nFreq;
    LARGE_INTEGER nBeginTime;
    LARGE_INTEGER nEndTime;
	double time1, time2;

	for( int num = 1; num <= 5; num++ )
	{
		scanf( "%d%d", &n, &m );
		scanf( "%s%s", t+1, p+1 );
		file[17] = 48 + num;

		freopen( file, "a", stdout );

		QueryPerformanceFrequency( &nFreq );

		QueryPerformanceCounter( &nBeginTime );
		Compute_Pre_Bc( );
		QueryPerformanceCounter(&nEndTime);
		time1=(double)(nEndTime.QuadPart-nBeginTime.QuadPart)/(double)nFreq.QuadPart * 1000000;

		QueryPerformanceCounter( &nBeginTime );
		pos = Quick_Search( );
		QueryPerformanceCounter(&nEndTime);
		time2=(double)(nEndTime.QuadPart-nBeginTime.QuadPart)/(double)nFreq.QuadPart * 1000000;

		printf( "Quick_Search:\n" );
		printf( "		first match position:  %d\n", pos );
		printf( "		time for pretreatment: %.3lf\n", time1 );
		printf( "		time for first match:  %.3lf\n", time2 );
		printf( "\n" );

		fclose( stdout );

	}
}

int Compute_Pre_Bc( )
{
	for( int i = 0; i <= 255; i++ )
		Bc[i] = m + 1;
	for( int i = 1; i <= m; i++ )
		Bc[ p[i] ] = m + 1 - i;
}

int Quick_Search( )
{
	int i = 1;
	while( i <= n-m+1 )
	{
		int j = 1;
		while( j <= m && p[j] == t[i+j-1] ) j++;
		if( j == m+1 ) return i;
		i = i + Bc[ t[i+m] ];
	}
	return -1;
}