u012513234的专栏

void multiply_1(char number1[],char number2[]) {     int len1=0,len2=0; char *p1=number1,*p2=number2; while (*p1++) { len1++; } while (*p2++) { len2++; } p1=NULL; p2=NULL; cout for (int

#include "stdafx.h" #include #include #include #include #include #include using namespace std; #include #include #include // BSTreeNode1.cpp : 定义控制台应用程序的入口点。 // template class StackWithMin {

int kmp(char S[],char T[],int Next[],int S_length,int T_length) { int i=0; int j=0; while (i<S_length&&j<T_length) { if (j==-1||S[i]==T[j]) { i++; j++; } else { j=Next[j]; } } if (j>=T_length) { retur

//堆排序 //交换两个值 void swap(int *a,int *b) { *a=*a^*b; *b=*a^*b; *a=*a^*b; } //调整堆 大顶堆 void adjustHeap(int *a,int size,int i) { if (i>size/2) //如果不是非终端结点 { return; } int max_index=i; int leafChild=2*i;

void display(int a[],int len) { for (int i=0;i<len;i++) { cout<<a[i]<<" "; } cout<<endl; } bool com(int a,int b) { return a>=b?1:0; } void StraightInsertSort(int a[],bool(*com)(int,int),int len) {

int Sort(int a[],int low,int high) { int mid_axis=a[low]; //中轴的值 while(low<high) { while(low=mid_axis) { high--; } a[low]=a[high]; while(low<high&&a[low]<=mid_axis) { low++; } a[high]=a[l

struct ArcNode { int headVex,tailVex; //头尾顶点 ArcNode *headIN,*tailOut; int weight; }; struct VexNode { int data; ArcNode *firstIN,*firstOUT; }; struct Graphic { int vexNum,arcNum; //顶点和弧个

int main() { int a[8]={-1,-2,-3,-10,-4,-7,-2,-5}; int sum=0; int GreateSum=0; for (int i=0;i<8;i++) { sum+=a[i]; if (sum<0) { sum=0; } if (sum>GreateSum) { GreateSum=sum; } } if (GreateSum==0) { for