L_Aster的专栏

已知前序、中序求后序#include <stdio.h>void PreAndInToPost(char *preorder,char *inorder,int lenth){ if(lenth==0) return; char temp=*preorder; int rootindex=0; while(*preorder!=inorder[ro

#include <stdio.h>int c=0;void move(int disk,char start,char end){ printf("step:%d,move %c to %c\n",++c,start,end); return;}void hanoi(int n,char A,int B,char C){ if(n==1) mov

#include #include using namespace std;bool isLegal(int row,int col,vector &v,int n){ for(int i=0;i<row;++i) if(v[i][col]=='Q') return false; for(int i=row-1,j=col-1;i>=0&&j>=0;--i,--j)