#include <iostream>
using namespace std;
const int N = 20;
int g[N][N];
int main()
{
int n,m;
cin>>n>>m;
char v[N];
cin>>v;
int a,b;
while(m--)
{
char l,r;
cin>>l>>r;
for(int i=0;i<n;i++)
{
if(v[i] == l) a = i;
if(v[i] == r) b = i;
}
g[a][b] = g[b][a] = 1;
}
for(int i=0;i<n;i++)
{
int sum = 0;
for(int j=0;j<n;j++)
if(g[i][j] == 1) sum++;
i==0 ? cout<<sum : cout<<" "<<sum;
}
return 0;
}
创建邻接矩阵并求每个节点的度
于 2024-03-18 15:34:16 首次发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)