汉诺塔

递归实现

https://pintia.cn/problem-sets/434/problems/5892

#include<stdio.h>
//int w=0;
void move(char x,char y);
void hanoi(int n,char one,char two,char three)
{
    if(n==1)
        move(one,three);
    else
    {
        hanoi(n-1,one,three,two);
        move(one,three);
        hanoi(n-1,two,one,three);
    }
}
void move(char x,char y)
{
    printf("%c->%c\n",x,y);
    //w++;
}
int main()
{
    int n;
        scanf("%d",&n);
        hanoi(n,'a','b','c');
        //printf("%d\n",w);有时候是求次数
    return 0;
}

可题目要求的是非递归实现，我真的一下子没想到该怎么去做，因为之前老师教汉诺塔就没有去想怎么实现的，只是记住了这个代码，现在换种方式就不知道了，而且递归用多了，真的会忘记其他的

非递归实现

https://blog.csdn.net/computerme/article/details/18080511

#include<string>
#include<iostream>
#include<algorithm>
#include<stack>
using namespace std;
int main()
{
 stack < int > a,b,c;
 int i,j,n;
 cin>>n;
 char s[4]={'p','a','b','c'}; 
 a.push(99999); b.push(999999); c.push(999999);
 for(i=n;i>=1;i--)
 {
  a.push(i);
  } 
 if(n%2==1)
 {
  s[2]='c';
  s[3]='b';
 }
  for(i=1;;i++)
  {
   if(i%3==1)
   {
    printf("%c -> %c\n",s[1],s[2]);
    b.push(a.top());
    a.pop();
     if(b.size()==n+1||c.size()==n+1)
  break;
    if(c.top()>a.top())
    {
     printf("%c -> %c\n",s[1],s[3]);
     c.push(a.top());
     a.pop();
    }
    else
    {
     printf("%c -> %c\n",s[3],s[1]);
     a.push(c.top());
     c.pop();
    }
   }
  else if(i%3==2)
  {
   printf("%c -> %c\n",s[2],s[3]);
   c.push(b.top());
    b.pop();
     if(b.size()==n+1||c.size()==n+1)
  break;
    if(b.top()>a.top())
    {
     printf("%c -> %c\n",s[1],s[2]);
     b.push(a.top());
     a.pop();
    }
    else
    {
     printf("%c -> %c\n",s[2],s[1]);
     a.push(b.top());
     b.pop();
    }
  }
  else
  {
   printf("%c -> %c\n",s[3],s[1]);
   a.push(c.top());
    c.pop();
     if(b.size()==n+1||c.size()==n+1)
  break;
    if(c.top()>b.top())
    {
     printf("%c -> %c\n",s[2],s[3]);
     c.push(b.top());
     b.pop();
    }
    else
    {
     printf("%c -> %c\n",s[3],s[2]);
     b.push(c.top());
     c.pop();
    }
   i=0;
  }
//  if(b.size()==n+1||c.size()==n+1)
//  break;
  }
 }