老王

public class Test {/*** @param args*/public static void main(String[] args) {// TODO Auto-generated method stub        ZuThree zt = new ZuThree(2,9,1,4);        zt .backtrack(0);}

/** * 思想：找到最小的数的索引，与未排序的首项交换 */ private void choicesort(int a[]){ int index=-1; int n=a.length; int temp=-1; for(int i=0;i<n-1;i++){ index=i; for(int j=i+1;j<n;j++){ if(a[index]

public class Test {/*** @param args*/public static void main(String[] args) {// TODO Auto-generated method stub      int mm[][]={{7},{3,8},{8,1,0},{2,7,4,4},{4,5,2,6,5}}; NumberTrian

/*集合划分问题： * n个元素的集合{1,2,.,n }可以划分为若干个非空子集。例如，当n=4 时，集合{1,2,3,4}可以划分为15个不同的非空子集如下： {1}，{2}，{3}，{4}}， {{1，2}，{3}，{4}}， {{1，3}，{2}，{4}}， {{1，4}，{2}，{3}}， {{2，3}，{1}，{4}}， {{2，4}，{1}，{3}}， {{3，4

package com.wzs;import java.util.Scanner;public class Test {/*** @param args*/public static void main(String[] args) {// TODO Auto-generated method stubScanner sc = new Sca

package com.wzs;public class Test {/*** @param args*/public static void main(String[] args) {// TODO Auto-generated method stub      Queue queue = new Queue(8);      queue.back

//全排列public class Test {   public static void main(String []args){  char str[]={'a','b','c','d'};  Arrange arr = new Arrange(str);  arr.backtrack(0);   }}class Arrange{  char []a

public class Test {/*** @param args*/public static void main(String[] args) {for(int i = 100;iif(shuixianhua(i)){System.out.println(i);}}}static boolean shuixianhua(int i){

import java.util.Arrays;import java.util.Scanner;public class Test {    public static void main(String []argc){        Scanner sc = new Scanner(System.in);    int n=sc .nextInt()

import java.util.Scanner;public class Test {/*** @param args*/public static void main(String[] args) {// TODO Auto-generated method stub      int hh[]={389,207,155,300,299,

public class Test {/*** @param args*/public static void main(String[] args) {// TODO Auto-generated method stub      GoStair gs = new GoStair(6);      gs.backtrack(0);}}

题目：真币的重量相等，假币的重量比假币轻，只有一个假币#include using namespace std;#define MAXNUM 100int getFalseCoin(int coin[],int start,int end){ //出口 if(end-start==1){ return coin[start]>coin[end]?end:start; } i