static void cumput(int score, int num)
 {
    // 无法完成的事件
  if(score < 0 || score > (num+1)*10 ) //次数num为0～9
       return;
   
    if(num == 0)
    {
         store[num] = score;
         output();
         return;
    }
   
    for(int i = 0; i <= 10; ++i)
    {
         store[num] = i;
         cumput(score - i, num - 1);
    }
 }

 private static final String DISK_B = "diskB";
 private static final String DISK_C = "diskC";
 private static final String DISK_A = "diskA";
 static String from = DISK_A;
 static String to = DISK_C;
 static String mid = DISK_B;

 public static void main(String[] args) {
    int num = 3;
    move(num, from, mid, to);
 } 
private static void move(int num, String from2, String mid2, String to2) {
  if (num == 1) {
   System.out.println("move disk 1 from " + from2 + " to " + to2);
  } else {
   // 将num-1块盘子搬走
   move(num - 1, from2, to2, mid2);
   // 将最后一块（num）块盘子搬到目的地
   move(num, from2, to2);
   // 将num-1块盘子搬回
   move(num - 1, mid2, from2, to2);
  }

 }
 
 private static void move(int cur, String from, String to) {
  System.out.println("move disk " + cur + " from " + from + " to "
    + to);
 }
}

public class PaiLie {

 /**
  * @param args
  */
 public static void main(String[] args) {
  List<String> strList = new ArrayList<String>();
  strList.add("a");
  strList.add("b");
  strList.add("c");
  
  quanpailie(strList, 0);
 }
 
 /**
  * 按递归算法列出全排列
  * @param strList
  * @param cur
  */
 private static void quanpailie(List<String> strList, int cur)
 {
  if(cur >= strList.size()) {
   System.out.println(strList);
   return;
  }
   
  for(int i = cur; i < strList.size(); i++)
  {
   wape(strList, cur, i);
   quanpailie(strList, cur+1);
   wape(strList, cur, i);
  }
 }

 /**
  * 交换第i和j位置的值
  * @param strList
  * @param i
  * @param j
  */
 private static void wape(List<String> strList, int i,int j )
 {
  String temp = strList.get(i);
  strList.set(i, strList.get(j));
  strList.set(j, temp);
  
 }
}