19C专题练习2
6-5 函数search在字符串s中查找子串t,返回子串t在s中的首地址。若未找到,则返回NULL。
裁判测试程序样例:
#include <stdio.h>
#define MAXS 30
char *search(char *s, char *t);
void ReadString( char s[] ); /* 裁判提供,细节不表 */
int main()
{
char s[MAXS], t[MAXS], *pos;
ReadString(s);
ReadString(t);
pos = search(s, t);
if ( pos != NULL )
printf("%d\n", pos - s);
else
printf("-1\n");
return 0;
}
测试样例:
1、input: The C Programming Language
ram
output:10
2、input: The C Programming Language
bored
output:-1
函数定义:
char *search(char *s, char *t){
int i,j,k=0,slen,tlen;
char *p=NULL;
while (s[slen] != '\0')
{
slen++;
}
while (t[tlen] != '\0')
{
tlen++;
}
for(i=0;i<slen;i++){
j=i;
while(s[j]==t[k])
{
k++;
j++;
}
if(k>=tlen)
{
p = &s[i];
return p;
}
k=0;
}
return p;
}
6-8 学生成绩链表处理 (20 分)
本题要求实现两个函数,一个将输入的学生成绩组织成单向链表;另一个将成绩低于某分数线的学生结点从链表中删除。
注意要点:①怎么输入信息:先输入num,判断后再输入其他,别想个二货一样直接就全部输入。
②画图表示链表指针指向,自己做时一直提示段错误/运行时错误就是因为第52,53行的中括号位置不当。
函数接口定义:
struct stud_node *createlist();
struct stud_node *deletelist( struct stud_node *head, int min_score );
函数createlist利用scanf从输入中获取学生的信息,将其组织成单向链表,并返回链表头指针。链表节点结构定义如下:
struct stud_node {
int num; /*学号*/
char name[20]; /*姓名*/
int score; /*成绩*/
struct stud_node *next; /*指向下个结点的指针*/
};
输入为若干个学生的信息(学号、姓名、成绩),当输入学号为0时结束。
函数deletelist从以head为头指针的链表中删除成绩低于min_score的学生,并返回结果链表的头指针。
裁判测试程序样例:
#include <stdio.h>
#include <stdlib.h>
struct stud_node {
int num;
char name[20];
int score;
struct stud_node *next;
};
struct stud_node *createlist();
struct stud_node *deletelist( struct stud_node *head, int min_score );
int main()
{
int min_score;
struct stud_node *p, *head = NULL;
head = createlist();
scanf("%d", &min_score);
head = deletelist(head, min_score);
for ( p = head; p != NULL; p = p->next )
printf("%d %s %d\n", p->num, p->name, p->score);
return 0;
}
输入样例:
1 zhang 78
2 wang 80
3 li 75
4 zhao 85
0
80
输出样例:
2 wang 80
4 zhao 85
答案:
struct stud_node *createlist()
{
int num;
struct stud_node *p, *head = NULL, *tail = NULL;
scanf("%d", &num);
int size = sizeof(struct stud_node);
while(num != 0)
{
p = (struct stud_node *) malloc(size);
p->num = num;
scanf("%s%d", p->name, &p->score);
p->next = NULL;
if (head == NULL)
{
head = p;
}
else
{
tail->next = p;
}
tail = p;
scanf("%d", &num);
}
return head;
}
struct stud_node *deletelist( struct stud_node *head, int min_score )
{
struct stud_node *p1, *p2;
while (head != NULL && (head->score < min_score) )
{
p2 = head;
head = head->next;
free(p2);
}
if (head == NULL)
{
return NULL;
}
p1 = head;
p2 = head->next;
while (p2 != NULL)
{
if (p2->score < min_score)
{
p1->next = p2->next;
free(p2);
}
else
{
p1 = p2;
}
p2 = p1->next;
}
return head;
}