午夜在线网站,精品国产一区二区三区久久久 ,在线资源免费观看

飞熊 — Tue, 19 Jan 2010 06:31:00 GMT

飞熊 2010-01-19 14:31 发表评论

十枪90环－�Q�递归

飞熊 — Tue, 19 Jan 2010 06:29:00 GMT

题目�Q�打十枪�Q�一共打�?0环，可以打成0环。共有多��种打法�Q?br />
public static void main(String[] args) {
    cumput(90, 9);
     System.out.println("��L��:"+sum);
}

static int sum;
static int store[] = new int[10];
static void output()
{
     for(int i = 9; i>=0; --i)
     {
        System.out.print(store[i] + " ");
     }
    System.out.println();
    ++sum;
}

static void cumput(int score, int num)
{
    // 无法完成的事�?br />  if(score < 0 || score > (num+1)*10 ) //�ơ数num�?�?
       return;

    if(num == 0)
    {
         store[num] = score;
         output();
         return;
    }

    for(int i = 0; i <= 10; ++i)
    {
         store[num] = i;
         cumput(score - i, num - 1);
    }
}

飞熊 2010-01-19 14:29 发表评论

汉诺塔算法－�Q�递归实现

飞熊 — Tue, 19 Jan 2010 06:25:00 GMT

public class Hanoic {

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块盘子搬�?br />   move(num - 1, from2, to2, mid2);
   // ��最后一块（num�Q�块盘子搬到目的�?br />   move(num, from2, to2);
   // ��num-1块盘子搬�?br />   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);
}
}

飞熊 2010-01-19 14:25 发表评论

全排列－�Q�递归��法

飞熊 — Tue, 19 Jan 2010 03:46:00 GMT

import java.util.ArrayList;
import java.util.List;

public class PaiLie {

/**
* @param args
*/
public static void main(String[] args) {
  List strList = new ArrayList();
  strList.add("a");
  strList.add("b");
  strList.add("c");

  quanpailie(strList, 0);
}

/**
* 按递归��法列出全排�?br /> * @param strList
* @param cur
*/
private static void quanpailie(List 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);
  }
}

/**
* 交换�W�i和j位置的�?br /> * @param strList
* @param i
* @param j
*/
private static void wape(List strList, int i,int j )
{
  String temp = strList.get(i);
  strList.set(i, strList.get(j));
  strList.set(j, temp);

}
}

飞熊 2010-01-19 11:46 发表评论

午夜在线网站,精品国产一区二区三区久久久 ,在线资源免费观看

十枪90环－�Q�递归

汉诺塔算法－�Q�递归实现

全排列－�Q�递归���法

全排列－�Q�递归��法