摘要：#include <iostream> using namespace std; int a[10][10]; static int r=0; void f(int k) { if(k==4){ cout<<a[r][1]<<a[r][2]<<a[r][3]<<endl; r++;} else{ a 阅读全文

摘要：#include<iostream> #define MAXSIZE 20 #define OK 1 #define ERROR 0 using namespace std; typedef struct stack { char *elem; int top; } Sqstack; void in 阅读全文

摘要：#include <iostream> using namespace std; #define STACKSIZE 10 typedef struct { int *base; int top; int StackSize; } SqList; void initStack(SqList *&s) 阅读全文

摘要：迷宫问题，打印所有路径，深度搜索，dfs 阅读全文

摘要：#include<bits/stdc++.h>using namespace std;int maze [5][5] = {0, 1, 0, 0, 0,0, 1, 0, 1, 0,0, 0, 0, 0, 0,0, 1, 1, 1, 0,0, 0, 0, 1, 0,};typedef struct { 阅读全文