weixin_45647589的博客

习题2.5 两个有序链表序列的合并 (15分)List Merge( List L1, List L2 ){ List L= (List)malloc(sizeof(struct Node));//建立链表 List h = L; List L1h = L1->Next; List L2h = L2->Next; while(L1h != NULL && L2h != NULL){ if(L1h->Data < L2h->Dat

数据结构1.1 最大子列和问题 (20分)算法：二分法#include <iostream>//#include <bits/c++io.h>#include <queue>#include <stdio.h>#include <utility>#include <string.h>#include <cstring>#include <cstdio>#include <stack&g