lamch_K的博客

13.3 链表-按顺序插入和查找删除节点#include <stdio.h>#include <string.h>#include <stdlib.h>struct Student{ int id; char name[16]; Student* next;};// 定义了一个有头节点Student m_head = {0};// 按顺序插入节点int inse

#include<stdio.h>int split(char text[], char* parts[]){ int count = 0; // 分段的个数 int start = 0; // 每一分段的首地址 int flag = 0; // 遍历text，标识当前是否处于有效字符 int stop = 0; // 是否到达结束 for(int i=

#include<stdio.h>#include <stdlib.h>#include <time.h>int main(){ int seed = time(NULL);//给予种子 printf("seed: %d\n", seed); srand(seed); for (int i = 0; i < 10; i++) printf("%

动态内存分配

链表遍历

#include <stdio.h>#include <string.h>struct Student{ int id; char name[16]; Student* next;};Student ss[4]={ { 1, "xxs",0 }, { 2, "xxx",0 }, { 3, "xxy",0 }, { 4, "xxz",0