使用棧求n個(gè)元素的所有排列

1、使用棧求n個(gè)元素的所有排列1.實(shí)驗(yàn)?zāi)康氖煜５腁DT以及它的方法實(shí)現(xiàn)，學(xué)會(huì)用棧的方法去解決一些問(wèn)題。2.實(shí)驗(yàn)要求求n個(gè)元素的所有排列，要求：使用棧。例如n=3時(shí)得：123、132、213、231、312、321 3.算法設(shè)計(jì)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()&&!ba

2、ck) int i=stack.pop();for(;i<n;i+) if(!stack.find(i+1) stack.push(i+1);for(int j=1;j<n+1;j+) if(!stack.find(j)stack.push(j); System.out.println(stack.toString(); back=false;break; 4.軟件結(jié)構(gòu) 5.程序清單1.StackADT:importtackException;public interface StackADT public int size();public boolean isEmpty();p

3、ublic 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()st

4、ack=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 Objectstac

5、k.length*2+1;for(int i=0;i<top;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+)st

6、ring=string+stacki.toString();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.

7、push(a); System.out.println(stack.toString(); boolean back=false;while(!stack.isEmpty()&&!back) int i=stack.pop();for(;i<n;i+) if(!stack.find(i+1) stack.push(i+1);for(int j=1;j<n+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("當(dāng)n="+n+"時(shí),所有排列如下:");Exp