LoverJuan的博客

#include #include typedef structPolyNode *Polynomial;struct PolyNode{    int coef;    int expon;    Polynomial link;};Polynomial ReadPoly();void Attach(

#include #include typedef int ElementType;typedef struct TNode *BinTree;typedef BinTree Position;struct TNode{    ElementType Data;    BinTree Left;    BinTree Right;};BinTre

上代码：#include <stdio.h>int main(int argc, char *argv[]) { int n; scanf("%d",&n); int data[100][100]; int i =0; int j= 0; for(i=1; i<=n; i++){ for(j=1; j<=i; j++) { scanf("%d...

#include <stdio.h>#include <stdlib.h>/* run this program using the console pauser or add your own getch, system("pause") or input loop */int main(int argc, char *argv[]) { int n; in...

贪心得每次都要最小值。#include <stdio.h>#include <stdlib.h>/* run this program using the console pauser or add your own getch, system("pause") or input loop */double *get_P(int *count, int len);...

#include <stdio.h>#include <stdlib.h>int *data;int *result;int sum;int n,c;int cut;//int main(int argc, char *argv[]) { scanf("%d %d",&n,&c); data = malloc(sizeof(int)*(n+...

KMP算法用于在主串中查找子串。核心：当匹配失败后需要回溯时，要在此次失败的匹配中寻找一些信息，这些信息在哪里？如图：a和c匹配失败时，此次失败的匹配已经完成了前面ababab串的成功匹配。有什么用？对于ababab串，求其前缀集合{a, ab, aba, abab, ababa}和后缀集合{babab, abab, bab, ab, b}和交集{abab}中的最大长度的元素。即{...

#include <iostream>#include <math.h>#include <list>#include <string>#include <sstream>using namespace std;int sys = 10;long long num = 0;string op = "";void cle...

a，b的最小公倍数 = a ×b ÷ （a，b的最大公约数）n个数的最小公倍数 = n个数乘积 ÷ （n-1组的最大公约数乘积）#include <iostream>using namespace std;int greatest_common_divisor(int a, int b) { if (a<b) { int temp = a...

简单的两个函数的并查集即可，不用做路径压缩。#include <iostream>using namespace std;int root[1000001];//初始化 刚开始每株植物的根都是自己的根void init(int n) { for (int i=1; i<=n; i++) { root[i] = i; }}in...

#include <iostream>#include <cstring>using namespace std;int visited[10];//访问标志数组int arr[10];//将全排列数放在数组中 每一位一个int sum = 0;//记录个数int num = 0;//输入的数#define LEN 9//剪枝函数void DEL() ...

#include #include #define MaxVertexNum 50#define false 0#define true 1typedef int bool;typedef int Vertex;typedef int WeightType;struct VertexNode;//顶点结构struct AdjNode;//邻接顶点结构type

#include #include #define MaxVertexNum 50typedef int bool;enum {false, true};typedef int Vertex;typedef int WeightType;struct VertexNode;//顶点结构struct AdjNode;//邻接顶点

List Reverse( List L ){    PtrToNode head = L;    if(head)    {        PtrToNode temp = head;        PtrToNode last = NULL;        while (temp) {            temp = temp->Next;       

#include #include typedef int ElementType;typedef structTreeNode *Tree;typedef Tree Position;struct TreeNode{    ElementType Data;    Tree Left,Right;    int flag

BinTree Insert( BinTree BST,ElementType X ){    if (BST ==NULL) {        BinTree Node =malloc(sizeof(structTNode));        Node->Data = X;        Node->Left = Node->Right =

int Max(int a, int b){    return a>b?a:b;}int GetHeight( BinTree BT ){    if (BT == NULL) {        return 0;    }else    {        return 1 + Max(GetHeight(BT->L

#include #include typedef structLinkedNode *List;typedef int DistType;typedef int Vertex;typedef structTableEntry *Table;enum bool{false,true};struct LinkedNode{

#include #include typedef int ElementType;typedef structAvlNode *AvlTree;typedef structAvlNode *Position;struct AvlNode{    ElementType Element;    AvlTree Left;

#include #include typedef int ElementType;typedef structLinkedNode *LinkedList;struct LinkedNode {    ElementType Data;    LinkedList link;    int Address,Next;};

#include #include typedef int ElementType;typedef structTreeNode *Tree;typedef Tree QueueElementType;struct TreeNode{    ElementType Data;    Tree Left, Right;};

#include "stdio.h"#include "stdlib.h"typedef struct TreeNode *Tree;typedef char ElementType;typedef struct stack *Stack;typedef Tree ElementTypeOfStack;struct TreeNode{ElementType Data

#include #include typedef char TElemType;typedef enum {Link,Thread} pointertag;typedef struct TBTNode TBTNode;//结构体类型typedef TBTNode *BiThrTree;//结构体指针类型struct TBTNode{

#include <iostream>#include <string>#include <sstream>#include <cstring>using namespace std;int a[100001];int main(){ memset(a, 0, 100001); int n; ...