遇见生活

#include <iostream>using namespace std;const int N = 1e5+10;int a[N];int main(){ int n; cin >> n; for(int i = 0;i < n;i++)cin >> a[i]; int ...

#include <iostream>using namespace std;int n,k; const int N = 1e5+10;int a[N];int main(){ cin >> n >> k; for(int i = 0;i < n;i++)cin >> a[i]; for(int i = 0;i...

Position BinarySearch( List L, ElementType X ){ int begin = 0,last = L->Last; for(int i = 1;i <=last;i++) { if(L->Data[i] == X){ return i; } ...

void DFS( MGraph Graph, Vertex V, void (*Visit)(Vertex) ){ Visited[V] = true; Visit(V); for(int i = 0; i < Graph->Nv;i++) { if(!Visited[i]&&Graph->G[V][i]==1){ DFS(Graph...

/* 这个题很简单，就是B题的一种变形，直接把B题的代码copy过来，然后改一下变量就过了*/int hasPath(struct Graph *g, int v, int w){ int vm = 0; int q[1000]; int front = -1, rear = -1; q[++rear] = v; int...

void PreorderPrintLeaves( BinTree BT ){ if(!BT)return; if(BT->Left==NULL&&BT->Right==NULL)printf(" %c",BT->Data); PreorderPrintLeaves(BT->Left); PreorderPrintLeaves(BT->Ri...

void InorderTraversal( BinTree BT ){ if(!BT)return; InorderTraversal(BT->Left); printf(" %c",BT->Data); InorderTraversal(BT->Right);}void PreorderTraversal( BinTree BT ){ if(!BT)ret...

int GetHeight( BinTree BT ){ if(BT==NULL)// 如果根为NULL ，则返回0 return 0; int l = GetHeight(BT->Left) + 1; int r = GetHeight(BT->Right) + 1; if(l>r)return l; else return r;}...

void InitQueue(SqQueue *&q) //初始化队列；{ q = new SqQueue; for(int i = 0;i<MaxSize;i++) {// cout<<"sd"<<endl; q->name[i] = new char; }// cout<<"sd"<<endl; ...

Status QueueInsert(LinkQueue *Q,ElemType e){ LinkList p =(LNode*)malloc(sizeof(LNode)); p->data = e; p->next = NULL; Q->rear->next = p; Q->rear = p; return OK;}Status QueueDe...

Status Push(LinkList L,ElemType e){ LinkList p =malloc(sizeof(LinkList)); p->data = e; p->next = L->next; L->next = p; return e; }Status Pop(LinkList L,ElemType *e){ if(!L...

bool Push( Stack S, ElementType X ){ if (S->Top == S->MaxSize) { printf("Stack Full\n"); return false; } S->Data[++S->Top] = X; return true;}ElementType Pop( Stack S ){ if(...

Stack CreateStack(int MaxSize){ Stack stk = malloc(sizeof(Stack)); stk->MaxSize = MaxSize; stk->Top1 = -1; stk->Top2 = MaxSize; stk->Data = (int*)malloc(MaxSize*sizeof(int)); retur...

#include <iostream>using namespace std;#include <set>#include <algorithm>int a,cnt;int main(){ int n; scanf("%d",&n); set<int>st; for(int i = 0;i < n;i++)...

#include <iostream>using namespace std;#include <string>#include <stack>#include <queue>#include <vector>const int N = 1e5;int q[N] ,hh= 0,tt = -1;// 入...

#include <iostream>using namespace std;#include <string>#include <stack>#include <queue> #include <vector>//int q[N] ,hh= 0,tt = -1;// 入队 //q[++tt] = x;////// ...

这个题目主要考的是KMP算法，我感觉KMP算法理解起来有点小困难，但是代码超级短，时间复杂度为（n+m），但是我发现字符串hash更好用一些，而且很容易理解这个是我对字符串hash的介绍，可能不是很全，但是希望大家可以理解我想表达的意思：这个文章中有我对字符串hash的模板https://blog.csdn.net/weixin_44235647/article/details/90181...

这个题目我自己开始就是用最传统的方法来做这个题，也就是和选择排序差不多的思路；只不过是不是交换而是删除；也就是先记录下链表当中第一个数字；然后拿这个数字和剩余的数字进行比较，如果相同则把当前这个节点删除，也就是将前一个节点指向该节点的下一个节点（和动态链表中的删除操作一样），然后就把这个删除的节点存到一个容器当中（这里我用的queue），然后接着用链表中的第二个数字，和剩余的数字进行比较，重复...

#include <iostream>using namespace std;#include <vector>struct Node{ int data; Node*next;};int main(){ int n, m; cin >> n >> m; vector<int>res; Node * firs...

/* 代码非原创*/#include<iostream>#include<vector>#include<cstdio>using namespace std;struct LNode{ int add; int data; int next;}List[100000];int main(){ int fa, n; vec...

List MakeEmpty(){ List head =malloc(MAXSIZE*sizeof(struct LNode)); head->Last = 0; return head;}Position Find( List L, ElementType X ){ int i = 0; for(i = 0;i < L-...

int SqInsert(SqList &L,ElemType e){ for(int j = 0;j<L.length-1;j++) { if(L.elem[j]>L.elem[j+1])return 0; } int i; for(i = 0;i<L.length;i++) { if(L.elem[i]>e)break; ...

struct Node* buildLinkedList(int* arr, int n){ struct Node* head = malloc(n*sizeof(struct Node)); struct Node* p = head; int i; for(i = 0;i < n;i++) { struct Node* p...

int insert_link ( LinkList L,int i,ElemType e){ if(i<=0)return 0; LinkList p = L; LinkList pre = p; int count = 1; if(!L)return 0; while(p) { pre = p; ...

struct Node* buildLinkedList(int* arr, int n){ struct Node* head = malloc(n * sizeof(struct Node)); struct Node* p = head; int i; for (i = n-1; i >= 0; i--) { struct Node* pc= malloc(...

int Length(List L){ int cnt = 0; List p = L; while (p) { p = p->Next; cnt++; } return cnt;}

ElementType FindKth(List L, int K){ int cnt = 0; List p = L; while (p) { cnt++; if (cnt == K) return p->Data; p = p->Next; } return ERROR;}

List Reverse( List L ){ if(!L)return NULL; List pc = L->Next; List pn = pc; List pre = L; while(pc) { pn = pc->Next; pc->Next = pre; pre = pc; pc = pn; } L->Nex...

/*删除排序链表中的重复元素*/LinkNode* deleteDuplicates(LinkNode* L){ LinkNode* p = L; while (p) { int d = p->data; LinkNode* p1 = p->next; LinkNode* pre = p; while (p1) { if (p1->...

/* Your function will be put here */Polynomial Add( Polynomial a, Polynomial b ){ if(!a->Next)return b; if(!b->Next)return a; Polynomial head = malloc(sizeof(Polynomial)); Polynomial p...

void DispList(DLinkNode* L){ DLinkNode* p = L->next; int i = 0; while (p) { printf("%c ", p->data); if (p == L->prior)break; p = p->next; } printf("\n");}int Symm(D...