使用栈求n个元素的所有排列

1、.使用栈求n个元素的所有排列1.实验目的熟悉栈的ADT以及它的方法实现，学会用栈的方法去解决一些问题。2.实验要求求n个元素的所有排列，要求：使用栈。例如n=3时得：123、132、213、231、312、321 3.算法设计public void pailie(int n)ArrayStack stack=new ArrayStack();for(int a=1;a=n;a+)stack.push(a); System.out.println(stack.toString(); boolean back=false;while(!stack.isEmpty()&!back) int i=st

2、ack.pop();for(;in;i+) if(!stack.find(i+1) stack.push(i+1);for(int j=1;jn+1;j+) if(!stack.find(j)stack.push(j); System.out.println(stack.toString(); back=false;break; 4.软件结构 5.程序清单1.StackADT:import java.util.EmptyStackException;public interface StackADT public int size();public boolean isEmpty();publ

3、ic void push(int n);public int pop()throws EmptyStackException;public int peek();public String toString();2.ArrayStack:import java.util.EmptyStackException;public class ArrayStack implements StackADTprivate Object stack; public int top ; private final int DEFAULT_CAPACITY=20;public ArrayStack()stack

4、=new Object DEFAULT_CAPACITY;top=-1;public ArrayStack(int size)stack =new Object size;top=-1;public int size()return top+1;public boolean isEmpty()return top=-1;public void push(int n)if(top+1=stack.length)expandCapacity(); stack+top=n; private void expandCapacity() Object newstack=new Objectstack.l

5、ength*2+1;for(int i=0;itop;i+)newstacki=stacki;stack=newstack;public int pop()throws EmptyStackExceptionif(top=-1)throw new EmptyStackException();return (Integer)stacktop-;public int peek() return (Integer) stacktop;public String toString()String string=;for(int i=0;i=top;i+)string=string+stacki.toS

6、tring();return string;public boolean find(int k) boolean result=false; for(int i=0;i=top;i+) if(k= (Integer)stacki) result=true;break; return result; 3.Expression:public class Expressionpublic void pailie(int n)ArrayStack stack=new ArrayStack();for(int a=1;a=n;a+)stack.push(a); System.out.println(st

7、ack.toString(); boolean back=false;while(!stack.isEmpty()&!back) int i=stack.pop();for(;in;i+) if(!stack.find(i+1) stack.push(i+1);for(int j=1;jn+1;j+) if(!stack.find(j)stack.push(j); System.out.println(stack.toString(); back=false;break; 4.TEST:import java.util.Scanner;public class TEST public static void main(String args) Scanner input=new Scanner(System.in);System.out.println(please input an integer:);int n=input.nextInt();System.out.println(当n=+n+时,所有排列如下:);Expressio