public String getPermutation(int n, int k) {
     int jiecheng[]=new int[10];
	 jiecheng[0]=1;
	 for(int i=1;i<10;i++)
	 {
		 jiecheng[i]=jiecheng[i-1]*i;
	 }
	 boolean jud[]=new boolean[n+1];
	 StringBuilder sBuilder=new StringBuilder();
	 int len=n-1;k--;
	 while (len>=0) {
		int va=k/jiecheng[len];//在剩下的第几个区间
		int team=0;
		for(int i=1;i<=n;i++)
		{
			if(jud[i])
				continue;
			if(team==va)//找到有效的第几个
			{
				jud[i]=true;
				sBuilder.append(i);
				break;
			}
			team++;
		}
	
		k=k%jiecheng[len];
		len--;
	}
	return sBuilder.toString();
}