IT孤鹜的专栏

#include#include#includeusing namespace std;typedef struct BTNode{ int data; BTNode *lchild,*rchild;}BTNode,*BTree;void CreateBTree(BTree &T){ int tmp; cin>>tmp; if(!tmp) T=NULL; else

1.输入一棵二元查找树，将该二元查找树转换成一个排序的双向链表。#includeusing namespace std;struct BSTreeNode{ int m_Value; BSTreeNode *m_pLeft; BSTreeNode *m_pRight;};typedef BSTreeNode *DoubleList,*BSTree;DoubleList phe

#include#include#include#includeusing namespace std;class HString{private: char kind[2]; //操作类型 char *str; //字符串 int length;

不重复：#include#define N 20int stack[N];int top=0;void fun(int m,int n){ int i; if(n<=0 || m<=0) return; if(m==n) { stack[top++]=n; for(i=0;i<top;i++) printf("%d ",stack[i

#include#define MAX 10using namespace std;class matrix;matrix& operator-(matrix& b,const matrix& c);class matrix{private: int row,col,(*a)[MAX];public: matrix(){} matrix(int r,int c,int (*b

import random#n = int(input("please input n:"))#m = int(input("please input m:"))#vote = int(input("please input vote:"))#print(int(random.uniform(1,vote)))n = 4m = 6v = 3source ={}for i in

#include#includeusing namespace std;using namespace cv;Mat src;int threshval=128;static void on_tracker(int ,void *){ Mat bin = src<threshval; //设置阈值 imshow("src",bin);}int main(){ s

拆分#includevoid main(){ char str[100]="123 ahdkf 345 sdhk 5 6 sdhk 7 sdfh 22 33"; char *pStr=str; int a; while(*pStr) { if(pStr == str && sscanf(pStr,"%d",&a)==1) p

#include#include #include#include#include#include#includeusing namespace std;const int N = 1000005;vector g[N];map > mp;int getRand(int n){ int value = (rand()%n)*(rand()%n); //printf("%

#includeusing namespace std;void MaxHeap(int heap[],int i,int len){ int largeIndex = -1; int left =i*2; int right =2*i+1; if(left heap[i]) largeIndex = left; else largeIndex = i; if (righ

如：输出123  4  5#include#includeusing namespace std;#define N 10void main(){ int tripnum=0,n=10,count=1,len; int data[N][N]; int left=0,right=n-1,up=0,down=n-1; for(;tripnum<(n+1)/2;t

#includeusing namespace std;void findstr(char* src,char *dst){ int i=0,j=0,pos; for(;src[i];) { j=0; if(src[i]==dst[j]) { pos=i; while(dst[j]&&sr

#include#includevoid main(){ time_t tim; struct tm *at; char now[40]; time(&tim); at=localtime(&tim); strftime(now,40,"%Y%m%d\n",at); puts(now); at->tm_mon+=3; strf

#includeusing namespace std;void main(){ int a[]={3,6,2,3,1,3,1,9,3,7}; int onemax,secmax,thrmax; onemax=secmax=thrmax=a[0]; for(int i=1;i<sizeof(a)/sizeof(a[0]);i++) { if(onemax<a[i])