#include<stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 100
//串
typedef struct
{
char *ch;
int len;
}String;
int main()
{
char sky[N]="12345";
int cnt=0;
while (sky[cnt])
{
printf("%c\n",sky[cnt++]);
}
String string;
string.ch=(char*)malloc(N*sizeof (char));
string.len=0;
int i=0;
string.ch=sky;
string.len=cnt;
printf("%s\n",string.ch);
//free(string.ch);
char time[100]="67890-qwetyuiopasdfklzxvbnm";
string.ch=time;
printf("%s",string.ch);
return strcmp(sky,time);
}
//补充:
// kmp算法
// next数组
复习-第四章-串
最新推荐文章于 2024-09-23 15:47:10 发布