pmn.java

来自「用java实现了数学上的排列组合问题」· Java 代码 · 共 46 行

import java.util.ArrayList;


public class Pmn {
	
	private String mString;
	private int n;
	
	
	public Pmn(String mString,int n){
		this.mString = mString;
		this.n = n;
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Pmn pmn = new Pmn("123456",4);
		String[] pmns = pmn.getPmnString();
		for(int i = 0;i < pmns.length;i ++){
			System.out.println(pmns[i]);
		}

		

	}
	
	public String[]  getPmnString(){
		Cmn cmn = new Cmn(mString,n);
		String[] cmns = cmn.getCmnString();
		ArrayList list = new ArrayList();
		Pnn pnn = new Pnn();
		for(int i = 0;i < cmns.length;i ++){
			String[] pnns = pnn.pnn(cmns[i]);
			for(int j = 0;j < pnns.length;j ++){
				list.add(pnns[j]);
			}
		}
		return (String[])list.toArray(new String[list.size()]);
		
	}

}