约瑟夫环-我的解答与迷宫

#include<iostream>
using namespace std;

typedef int ElemType;
typedef struct LNode
{
    ElemType data1;
    ElemType data2;
    struct LNode *next;
}LNode,*LinkList;
LinkList CreateList(int n)
{
    LinkList head,s;
    s=head=(LinkList)malloc(sizeof(LNode));
    for(int i=1;i<n;i++)
    {
        s->data1=i;
        cout<<"Please input cipher:";
        cin>>s->data2;
        if(s->data2<=0)
        {
            cout<<"Please input the cipher again:"<<endl;
            cin>>s->data2;
        }
        s->next=(LinkList)malloc(sizeof(LNode));
        s=s->next;
    }
    s->data1=i;
    cout<<"Please input cipher:"<<endl;
    cin>>s->data2;
    s->next=head;
    return s;
}

LinkList findLNode(int m,LinkList s)
{
    for(int i=1;i<m;i++)
        s=s->next;
    return s;
}

void main()
{
    int m,n;
    cout<<"Please input n:"<<endl;
    cin>>n;
    cout<<"Please input m:"<<endl;
    cin>>m;
    LinkList p,q;
    p=CreateList(n);

    for(int i=0;i<n;i++)
    {
        p=findLNode(m,p);
        cout<<p->next->data1<<" ";
        m=p->next->data2;
        q=p->next;
        p->next=q->next;
        //p->next=q->next;
        free(q);
        //p=p->next;
        
    }
}

#include<stdio.h>
#include <stdlib.h> 

int visit(int, int); 

int maze[7][7] = {{2, 2, 2, 2, 2, 2, 2}, 
{2, 0, 0, 0, 0, 0, 2}, 
{2, 0, 2, 0, 2, 0, 2}, 
{2, 0, 0, 2, 0, 2, 2}, 
{2, 2, 0, 2, 0, 2, 2}, 
{2, 0, 0, 0, 0, 0, 2}, 
{2, 2, 2, 2, 2, 2, 2}}; 

int startI = 1, startJ = 1; // 入口
int endI = 5, endJ = 5; // 出口
int success = 0;

int main(void) { 
int i, j; 

printf("顯示迷宮：
"); 
for(i = 0; i < 7; i++) { 
for(j = 0; j < 7; j++) 
if(maze[i][j] == 2) 
printf("█"); 
else 
printf(" "); 
printf("
"); 
} 

if(visit(startI, startJ) == 0)
printf("
沒有找到出口！
"); 
else { 
printf("
顯示路徑：
"); 
for(i = 0; i < 7; i++) { 
for(j = 0; j < 7; j++) { 
if(maze[i][j] == 2) 
printf("█"); 
else if(maze[i][j] == 1) 
printf("◇"); 
else 
printf(" "); 
} 
printf("
"); 
} 
} 

return 0; 
} 

int visit(int i, int j) { 
maze[i][j] = 1; 

if(i == endI && j == endJ)
success = 1; 

if(success != 1 && maze[i][j+1] == 0) visit(i, j+1); 
if(success != 1 && maze[i+1][j] == 0) visit(i+1, j); 
if(success != 1 && maze[i][j-1] == 0) visit(i, j-1); 
if(success != 1 && maze[i-1][j] == 0) visit(i-1, j); 

if(success != 1) 
maze[i][j] = 0; 

return success; 
}

#include<stdio.h>
#include <stdlib.h> 
int visit(int, int); 
int maze[7][7] = {{2, 2, 2, 2, 2, 2, 2}, 
{2, 0, 0, 0, 0, 0, 2}, 
{2, 0, 2, 0, 2, 0, 2}, 
{2, 0, 0, 2, 0, 2, 2}, 
{2, 2, 0, 2, 0, 2, 2}, 
{2, 0, 0, 0, 0, 0, 2}, 
{2, 2, 2, 2, 2, 2, 2}}; 

int startI = 1, startJ = 1; // 入口
int endI = 5, endJ = 5; // 出口
int success = 0;

int main(void) { 
int i, j; 

printf("顯示迷宮：
"); 
for(i = 0; i < 7; i++) { 
for(j = 0; j < 7; j++) 
if(maze[i][j] == 2) 
printf("■"); 
else 
printf(" "); 
printf("
"); 
} 

if(visit(startI, startJ) == 0)
printf("
沒有找到出口！
"); 
else { 
printf("
顯示路徑：
"); 
for(i = 0; i < 7; i++) { 
for(j = 0; j < 7; j++) { 
if(maze[i][j] == 2) 
printf("■"); 
else if(maze[i][j] == 1) 
printf("▲"); 
else 
printf(" "); 
} 
printf("
"); 
} 
} 

return 0; 
} 

int visit(int i, int j) { 
maze[i][j] = 1; 

if(i == endI && j == endJ)
success = 1; 

if(success != 1 && maze[i][j+1] == 0) visit(i, j+1); 
if(success != 1 && maze[i+1][j] == 0) visit(i+1, j); 
if(success != 1 && maze[i][j-1] == 0) visit(i, j-1); 
if(success != 1 && maze[i-1][j] == 0) visit(i-1, j); 

if(success != 1) 
maze[i][j] = 0; 

return success; 
}