问题
解析
设计
LCS问题
```void z(int B[][130], int i, int j) {
if (i == 0 || j == 0) {//长度为0跳出
return;
}
if (B[i][j] == 2) {
z(B, i - 1, j - 1);
printf("%c ", X[i]);//输出符合的字母
}
else if (B[i][j] == 1) {
z(B, i - 1, j);
}
else {
z(B, i, j - 1);
}
}
void LCS(char X[], int m, char Y[], int n, int C[][130], int B[][130]) {
for (int i = 1; i <= m; i++)
{
for (int j = 1; j <= n; ++j) {
if (X[i] == Y[j]) {//第一种情况,这时Zk-1是Xi-1和Yj-1的最长公共子序列
C[i][j] = C[i - 1][j - 1] + 1;
B[i][j] = 2;
}
else
{
if (C[i - 1][j] > C[i][j - 1])//第二种情况,这时Zk-1是Xi-1和Yj的最长公共子序列
{
C[i][j] = C[i - 1][j];
B[i][j] = 1;
}
else {
C[i][j] = C[i][j - 1];//第三种情况,这时Zk-1是Xi和Yj-1的最长公共子序列
B[i][j] = 0;
}
}
}
}
z(B, m, n);
}
```cpp
背包问题
```void Knapsack(int v[], int w[], int c, int n, int m[][10])
{
int jMax = min(w[n] - 1, c);//背包剩余容量上限 范围[0~w[n]-1]
for (int j = 0; j <= jMax; j++)
{
m[n][j] = 0;
}
for (int j = w[n]; j <= c; j++)//限制范围[w[n]~c]
{
m[n][j] = v[n];
}
for (int i = n - 1; i > 1; i--)
{
jMax = min(w[i] - 1, c);
for (int j = 0; j <= jMax; j++)//背包不同剩余容量j<=jMax<c
{
m[i][j] = m[i + 1][j];//没产生任何效益
}
for (int j = w[i]; j <= c; j++) //背包不同剩余容量j-wi >c
{
m[i][j] = max(m[i + 1][j], m[i + 1][j - w[i]] + v[i]);
}
}
m[1][c] = m[2][c];
if (c >= w[1])
{
m[1][c] = max(m[1][c], m[2][c - w[1]] + v[1]);
}
}
//x[]数组存储对应物品0-1向量,0不装入背包,1表示装入背包
void Traceback(int m[][10], int w[], int c, int n, int x[])
{
for (int i = 1; i < n; i++)
{
if (m[i][c] == m[i + 1][c])
{
x[i] = 0;
}
else
{
x[i] = 1;
c -= w[i];
}
}
x[n] = (m[n][c]) ? 1 : 0;
}
分析
Lcs的时间复杂度为O(mn).
背包问题的时间复杂度为O(n^2)
源码
https://github.com/TeAmo-Lan/Tracy-Y0617/blob/main/%E7%AE%97%E6%B3%95%E5%88%86%E6%9E%9009Lcs.cpp
https://github.com/TeAmo-Lan/Tracy-Y0617/blob/main/%E7%AE%97%E6%B3%95%E5%88%86%E6%9E%9009%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98.cpp