子字符串查找，字符串数组排序

最新推荐文章于 2022-04-13 22:38:08 发布

原创最新推荐文章于 2022-04-13 22:38:08 发布 · 371 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c字符串

本文介绍了一个简单的C语言程序，该程序包含两个主要功能：查找一个字符串是否为另一个字符串的子串，并返回其位置；以及对字符串数组进行排序。通过具体的代码实现展示了基本的字符串操作方法。

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

#include "stdio.h"
#include "stdlib.h"
#include "string.h"

int findSubStr(char* parent,char* sub);
void sortString(char *day[]);
int main(int argc, char const *argv[])
{
char *parent = "Welcome to china!";
char *sub ="toA";
char * day[] ={"Monday","Sunday","Wesnday"};
int result = -1;

result = findSubStr(parent,sub);
if(result!=-1)
{
printf("%s\n,pos = %d","found subString",result);
}else
printf("%s\n", "not found the subString");

sortString(day);
for (int i = 0; i < sizeof(day)/sizeof(day[0]); ++i)
{

printf("%s\n", day[i]);
}
// scanf("%d",&result);
return 0;
}

int findSubStr(char* parent,char* sub)
{
int pos =0;
int subpos;
while(*parent)
{

printf("%s\n", parent);
printf("%s\n", sub);
if(*sub=='\0')
{
printf("%s, pos = %d,subpos = %d\n", "found",pos-subpos,subpos);
printf("found parent = %s",parent);
return pos;
// break;
}
if(*sub==*parent)
{
sub++;
parent++;
pos++;
subpos++;
printf("sub = %s, pos=%d\n", sub,pos);
}else{
parent++;
pos++;
printf("now parent = %s sub= %s,subpos=%d\n",parent, sub ,subpos);
parent=parent-subpos;
sub = sub -subpos;
printf("now parent = %s sub= %s,subpos=%d\n",parent, sub ,subpos);
subpos=0;
}
}
if(*parent=='\0')
{
printf("%s\n", "not found");
return -1;
}
}

void sortString(char *day[])
{
char * Temp;
for (int i = 0; i < sizeof(day)/sizeof(day[0]); ++i)
{
for (int j = i; j < sizeof(day)/sizeof(day[0]); ++j)
{
if(strcmp(day[i],day[j])>0)
{
Temp = day[j];
day[j] = day[i];
day[i] = Temp;
}
}
// printf("%s\n", day[i]);
}
}