test
Go for it.Just do it!
Stay--hungry
这个作者很懒,什么都没留下…
展开
-
有序线性表的有序合并
原题链接#include <iostream>using namespace std;const int N = 100010;int L1[N], L2[N], L3[N];int main(){ int n1, n2, n3; while (cin >> n1) { for (int i = 0; i < n1; i ++) cin >> L1[i]; cin >> n2;原创 2021-11-22 17:42:46 · 416 阅读 · 0 评论 -
顺序表的并集
原题链接#include <iostream>using namespace std;struct SeqList{ int data[1000]; int length;};void init(SeqList &L){ L.length = 0;}void add(SeqList &L, int x){ L.data[L.length ++] = x;}bool ifExist(SeqList L, int x)原创 2021-11-22 17:41:24 · 274 阅读 · 0 评论 -
字符串替换
#include <iostream>using namespace std;int index(char S[], char T[]){ int lenS = strlen(S), lenT = strlen(T), i = 0, j = 0; while (i < lenS && j < lenT) { if (T[j] == S[i]) { i ++; j ++; } else { i = i -原创 2021-10-10 21:01:50 · 76 阅读 · 0 评论 -
学生选课系统
#include <stdio.h>#include <stdlib.h>#include <string.h>typedef struct{ int cNum; char cName[20]; int cGrade; char teacherName[20]; int maxStu; int times;}Course;typedef struct{ char sNum[5]; int k; int cou[10];}Student;原创 2021-07-28 15:57:26 · 277 阅读 · 0 评论