动态规划(03查找问题)最优二叉查找树和近似串匹配问题

最优二叉查找树
1.代码

#include<iostream>
#include<stdio.h>
#include<windows.h>
#include<iomanip>
using namespace std;
#define N 5
double C[N+1][N+1];
int R[N+1][N+1];
double OptimalBST(double p[ ], int n);
int main()
{
	int i,j;
	double p[]={0.1, 0.2, 0.4, 0.3}; 
    cout<<OptimalBST(p,4)<<endl;
	for( i=1;i<6;i++)
	{
		for( j=0;j<5;j++)
		{
			cout<<C[i][j]<<setw(6);
		}
		cout<<endl;
	}
	cout<<endl;
	for( i=1;i<6;i++)
	{
		for( j=0;j<5;j++)
		{
			cout<<R[i][j]<<setw(4);
		}
		cout<<endl;
	}
	Sleep(90000);
	return 0;
}
double OptimalBST(double p[ ], int n)
{
	int i, j, k, d, mink;
	double min, sum;
	for (i = 1; i <= n; i++)                //初始化主对角线和第一条次对角线
	{
        C[i][i-1] = 0;
        C[i][i] = p[i-1]; R[i][i] = i;
	}
	C[n][n-1] = 0;
	for (d = 1; d < n; d++)                //按对角线逐条计算
		for (i = 1; i <= n-d; i++)
		{
			j = i + d;
			min = 1000; mink = i; sum = 0;     //假设1000为最大值
			for (k = i; k <= j; k++)
			{
				sum = sum + p[k-1];
				if (C[i][k-1] + C[k+1][j] < min) {
					min = C[i][k-1] + C[k+1][j];
					mink = k;
				}
			}
			C[i][j] = min + sum;
			R[i][j] = mink;
		}
        return C[1][n];
}

2.结果示例

近似串匹配问题
1.代码

#include<iostream>
#include<stdio.h>
#include<windows.h>
#include<iomanip>
using namespace std;


int D[6][9];
int ASM(char P[ ], char T[ ], int m, int n);
int main()
{
	char P[]="happy";
	char T[]="hsppay";
	cout<<ASM(P,T,5,6)<<endl;
	Sleep(90000);
	return 0;
}
int min1(int x,int y,int z)
{
	int min;
	if (x < y) min = x;
	else min = y;
	if (z < min)
		min = z;
	return min;
}
int ASM(char P[ ], char T[ ], int m, int n)
{
	int i, j;
	for (j = 1; j <= n; j++)                     //初始化第0行
		D[0][j] = j;
	for (i = 0; i <= m; i++)                    //初始化第0列
		D[i][0] = i;
	for (j = 1; j <= n; j++)                    //根据递推式依次计算每一列
	{
		for (i = 1; i <= m; i++)
		{
			if (P[i-1] == T[j-1]) 
				D[i][j] =min1(D[i-1][j-1], D[i-1][j]+1, D[i][j-1]+1);
			else
				D[i][j] = min1(D[i-1][j-1]+1, D[i-1][j]+1, D[i][j-1]+1);
		}
		for (i = 1; i <= m; i++)
			cout<<D[i][j]<<"  ";
		cout<<endl;

	}
	return D[m][n];
}

2.结果示例