#include <iostream> #include <stdlib.h> #include <stdio.h> #include<string.h> using namespace std; #define null 0 #define maxsize 100 typedef char datatype; typedef struct node { datatype data[maxsize]; int length; }seqstring; void creat(seqstring *s)//建立字符串顺序表 { scanf("%s",s->data); s->length=strlen(s->data); } void print(seqstring str)//输出字符串 ，以'\0'结尾 { printf("list is:%s\n",str.data); } /*在字符串str中从第i个位置起取长度为len的子串(i从1开始），函数返回子串指针,若子串超出边界返回null。*/ seqstring* substring(
seqstring* substring(seqstring str, int i, int len) { seqstring* sub = (seqstring*)malloc(sizeof(seqstring)); if (i < 1 || i > str.length || len < 0 || i + len - 1 > str.length) { sub = NULL; return sub; } for (int j = 0; j < len; j++) { sub->data[j] = str.data[i - 1 + j]; } sub->data[len] = '\0'; sub->length = len; return sub; } [2024-10-16 08:51:55 | AI写代码神器 | 146点数解答]
相关提问
- #include <iostream> #include <stdlib.h> #include <stdio.h> #include<string.h> using namespace std; #define null 0 #define maxsize 100 typedef char datatype; typedef struct node { datatype data[maxsize]; int length; }seqstring; void creat(seqstring *s)//建立字符串顺序表 { scanf("%s",s->data); s->length=strlen(s->data); } void print(seqstring str)//输出字符串 ，以'\0'结尾 { printf("list is:%s\n",str.data); } /*在字符串str中从第i个位置起取长度为len的子串(i从1开始），函数返回子串指针,若子串超出边界返回null。*/ seqstring* substring(（146点数解答 | 2024-10-16 08:51:55）173
- ```cpp #include <iostream> using namespace std; struct node { int data; node* link; node(int x) : data(x), link(null) {} }; // 查找最大节点及其前一个节点 void findmaxandprev(node* list, node*& maxnode, node*& prevmax) { node* curr = list; maxnode = list; prevmax = null; node* prev = null; while (curr!= null) { if (curr->data > maxnode->data) { maxnode = curr; prevmax = prev; } prev = curr; curr = curr->link; } } // 将最大节点移到链表末尾 void movemaxtoend(node*& list) { node* maxnode = null; node* prevmax = null;（549点数解答 | 2024-10-14 22:55:13）221
- 检查代码 #include <ctype.h> #include <string.h> void verse(char* str) { *str = tolower(*str); int lens = strlen(str); printf("字符串长度为：%d\n", lens); for (int i = 0; i < lens / 2; i++) { char temp = str[i]; str[i] = str[lens - 1 - i]; str[lens - 1 - i] = temp; } } int pali(char *str) { int lens=strlen(str); char *reverse[lens+1]; strcpy(reverse, str); verse(reverse); return strcmp(str, reverse)==0; } int main() { char str[101];（655点数解答 | 2024-11-08 21:54:45）188
- #include <stdio.h> #include <stdlib.h> #include <stdbool.h> #define maxsize 100 typedef char elemtype; typedef struct node { elemtype data; struct node* lchild; struct node* rchild; } btnode; typedef struct { btnode* data[maxsize]; int top; } stacktype; void initstack(stacktype* st) { st->top = -1; } bool stackempty(stacktype* st) { return st->top == -1; } bool push(stacktype* st, btnode* e) { if (st->top < maxsize - 1) { st->data[++st->top] = e;（95点数解答 | 2024-12-10 13:17:25）141
- #include <stdio.h> #include <stdlib.h> #include <string.h> typedef struct sqlist //单链表结构体 { int data; struct sqlist *next; //指针域 }sqlist; void initlist (sqlist *l, sqlist *m, sqlist *n, sqlist *h) { //todo list yes l->next = null; m->next = null; n->next = null; h->next = null; } void emp(sqlist *l) { if (l->next==null) //todo list)yes printf("链表为空表。\n"); else printf("链表为非空表。\n"); } void length(sqlist *l) { sqlist *p; int length = 0; p=l->next; while(p!=null) { length++; p=p->next; } //todo list（345点数解答 | 2024-10-23 23:11:22）180
- #include<iostream> #include<string> #include<iomanip> #include<fstream> #include<stdlib.h> using namespace std; #define ok 1 #define error 0 #define overflow -2 typedef int status; //status 是函数返回值类型，其值是函数结果状态代码。 typedef int elemtype; //elemtype 为可定义的数据类型，此设为int类型 struct book { string id;//isbn string name;//书名 double price;//定价 }; typedef struct lnode { book data; //结点的数据域 struct lnode *next; //结点的指针域 } lnode, *linklist; //linklist为指向结构体lnode的指针类型 string head_1, head_2, head_3; int lengt（35点数解答 | 2024-10-31 17:38:15）175
- #include <stdio.h> #include <stdlib.h> #include <string.h> typedef struct sqlist //单链表结构体 { int data; struct sqlist *next; //指针域 }sqlist; void initlist (sqlist *l, sqlist *m, sqlist *n, sqlist *h) { //todo list yes l->next = null; m->next = null; n->next = null; h->next = null; } void emp(sqlist *l) { if (l->next==null) //todo list)yes printf("链表为空表。\n"); else printf("链表为非空表。\n"); } void length(sqlist *l) { sqlist *p; int length = 0; p=l->next; while(p!=null)（428点数解答 | 2024-10-23 23:09:51）185
- #include <stdio.h>#define maxsize 100typedef struct cstr{ char data[maxsize]; int len;}sqstring;sqstring *initsring(char a[]){ sqstring *l; l=(sqstring*)malloc(sizeof(sqstring)); int i=0; while(a[i]) { l->data[i]=a[i]; i++; } l->len=i; return l;}void printstring(sqstring *l){ int i=0; for(i=0;i<l->len;i++) { printf("%c",l->data[i]); } printf("\n");}sqstring *concat(sqstring *s,sqstring *t){ sqstring *l = initsring(""); int i=0; for(i=0;i<s->len;i++) { l->data[i]=s->data[i]; }（182点数解答 | 2024-11-15 17:13:22）188
- #include <stdio.h> void sort(char *p); int main(void) { char str[21] ; gets(str); sort(str); puts(str); return 0; } void sort(char *p) { int i,len=strlen(*p),ln=len-2,j; char *q; strncpy(q,*(p+1),len-2); for(i=0;i<len-3;i++) { for(j=0;j<ln-1;j++) { if(*(q+j)<*(q+j+1)) { int t=*(q+j); *(q+j)=*(q+j+1); *(q+j+1)=t; } ln--; } } strncpy(*(p+1),q,len-2); }（664点数解答 | 2024-12-06 09:27:31）195
- #include <stdio.h> #include <stdlib.h> #define maxsize 100 typedef struct cstr { char data[maxsize]; int len; } sqstring; // 初始化字符串 sqstring *initstring(char a[]) { sqstring *l; l = (sqstring *)malloc(sizeof(sqstring)); int i = 0; while (a[i]) { l->data[i] = a[i]; i++; } l->data[i] = '\0'; // 添加空字符 l->len = i; return l; } // 打印字符串 void printstring(sqstring *l) { int i = 0; for (i = 0; i < l->len; i++) { printf("%c", l->da（308点数解答 | 2024-11-15 17:12:32）124
- #include<stdio.h> #include<stdlib.h> #include<time.h> int producerand(int remainder); void initprocess(); void chosedisplace(); struct linknode* fifo(struct linknode* head, int randcount); void optimal(struct linknode* head, int randprocess); struct linknode* lru(struct linknode* head, int randprocess); struct linknode* initlink(); void choicestey(); int allotment(struct linknode* head); int checkfifooptimal(struct linknode* head, int checkpage); void recover(struct linknode* head, int randproc（60点数解答 | 2024-12-13 20:02:21）209
- #include<stdio.h> #include<stdlib.h> #include<time.h> int producerand(int remainder); void initprocess(); void chosedisplace(); struct linknode* fifo(struct linknode* head, int randcount); void optimal(struct linknode* head, int randprocess); struct linknode* lru(struct linknode* head, int randprocess); struct linknode* initlink(); void choicestey(); int allotment(struct linknode* head); int checkfifooptimal(struct linknode* head, int checkpage); void recover(struct linknode* head, int randproc（858点数解答 | 2024-12-13 20:03:47）195