上海交大数据结构机考技巧个人总结.docx

#include using namespace std;int data10000;int main()/栈 int top=0; /入栈： datatop+=x; /出站： y=data-top; /判空 top=0;/队列：int q100000, head=0, tail=0; /入队写qtail+ = a; /出队写a=qhead+; /队非空条件是 head size) return; /超过了二叉树的存储 cout size ) return; midorder(root*2); cout size ) return; postorder(root*2); postorder(root*2+1); cout =1;i-)percodown(a,i,10);void percodown(int a, int hole, int size) int tmp = ahole; int child; for(;hole*2 = size;) chile = hole*2; if(child!=size & achild+1 achile) child+; if(achild = high) return; mid = div(a,low,high); quicksort(a,low,mid-1); quicksort(a,mid+1,high);int div(int a,int low, int high) int tmp=alow; dowhile(low=tmp -high; if(low high) alow=ahigh;low+; while(lowhigh&alowtmp) low+; if(low high) ahigh=alow;high-;while (low!=high)alow=tmp;return low;#include using namespace std;const int N=7; int dataNN= 0,1,1,0,0,0,0, 0,0,0,1,1,1,0, 0,0,0,0,1,0,1, 0,0,0,0,0,0,0, 0,0,0,0,0,1,1, 0,0,0,1,0,0,0, 0,0,0,0,0,0,0 ;int main() int indegreeN=0; for(int i=0;iN;i+) int num=0; for(int j=0;jN;j+) if(dataji=1) num+; indegreei=num; /找入度为0(现在开始排序了！） for(int i=0;iN;i+) int j; for(j=0;jN&indegreej != 0;j+) if(indegreej=0) break; /找到度为0的点 cout j+1; indegreej=N; for(int k=0;kN;k+) if(datajk=1) indegreek-; return 0;#include using namespace std;int main() int d33=0,8,5,3,0,10000,6,2,0; int k=0,j=0,i=0; for(k=0;k3;k+) for(i=0;i3;i+) for(j=0;j3;j+) if(dik+d