贴几个常用小程序代码，大都递归的

1. 八皇后

public class Test {
    public int []cols=new int[9];
    public int count=0;
    public boolean check(int line,int i){
        int x=i;
        int y=line;
        while(x>0&&y>0){
            if(cols[x]==y)
                return false;
            x--;
            y--;
        }
        x=i;
        y=line;
        while(x>0&&y<9){
            if(cols[x]==y)
                return false;
            x--;
            y++;
        }
        x=i;
        y=line;
        while(x<9&&y>0){
            if(cols[x]==y)
                return false;
            x++;
            y--;
        }
        x=i;
        y=line;
        while(x<9&&y<9){
            if(cols[x]==y)
                return false;
            x++;
            y++;
        }
        return true;
    }
    public void print(){
        count++;
        System.out.println("begin placing...");
        for(int i=1;i<9;i++){            
            for(int j=1;j<9;j++){//每一行
                if(cols[j]==i){
                    System.out.print(" ●");
                }else{
                    System.out.print(" ○");
                }
            }
            System.out.println();
        }
        System.out.println("end placeing...");
    }
    public void place(int line){
        if(line>=9){
            print();
            return;
        }
        for(int i=1;i<9;i++){
            if(cols[i]==0){
                if(check(line,i)){
                    cols[i]=line;
                    place(line+1);
                    cols[i]=0;
                }
            }
        }
    }
    public static void main(String args[]){
        Test test = new Test();
        test.place(1);
        System.out.println("总共有："+test.count+"个解");
    }
}

2. 排列组合

public class Test2 {
    public int [] data ={1,2,3,4,5,6,7,8,9};
    public int [] result = new int[10];
    public int c(int n,int k){
        if(n<=k||k==0){
            return 1;
        }else{
            return c(n-1,k-1)+c(n-1,k);
        }
    }
    public void A(int[] array,int k,int[]result,int index){
        if(k<=0){
            for(int i=0;i<index;i++){
                System.out.print(result[i]+" ");
            }
            System.out.println();
            return;
        }
        for(int i=0;i<array.length;i++){
            int value = array[i];
            if(value!=-1){
                result[index]=value;
                array[i]=-1;
                A(array,k-1,result,index+1);
                array[i]=value;
            }
        }
    }
    public void C(int[] array,int k,int arrayIndex,int[] result,int index){
        if(k<=0){
            for(int i=0;i<index;i++){
                System.out.print(result[i]+" ");
            }
            System.out.println();
            return;
        }
        if((array.length-arrayIndex-k)<0){
            return;
        }
        for(int i=arrayIndex;i<array.length-k+1;i++){
            int value = array[i];
            if(array[i]!=-1){
                result[index]=value;
                array[i]=-1;
                C(array,k-1,i+1,result,index+1);
                array[i]=value;
            }
        }
        
    }
    
    public static void main(String[] args){
        //System.out.println(new Test2().c(5,3));
        Test2 test2 = new Test2();
        //test2.A(test2.data,2,test2.result,0);
        test2.C(test2.data,2,0,test2.result,0);
    }
}

3. 检查先序是否合法

package com.tuniu;

public class Test3 {
    String[] operators = new String[]{"+","-","*","/"};
    public boolean isOperator(String s){
        for(int i=0;i<operators.length;i++){
            if(s.equals(operators[i])){
                return true;
            }
        }
        return false;
    }
    public int testPre(String str,int scanIndex){
        if(scanIndex>=str.length())
            return -1;
        if(isOperator(str.substring(scanIndex, scanIndex+1))){
            int index = testPre(str,scanIndex+1);
            if(index==-1)
                return -1;
            else{
                return testPre(str,index);
            }
        }else{
            return scanIndex+1;
        }
    }
    public boolean isPre(String str){
        if(testPre(str,0)==str.length())
            return true;
        else
            return false;
    }
    
    public static void main(String[] args){
        String str = "--+ab/ac+bb";
        System.out.println(new Test3().isPre(str));
    }
}

4. 前序中序变后序

public class Test5 {
    //前序定根，中序定左右
    public Node pm2t(String pre,String middle){
        if(pre.length()==0)
            return null;
        Node node = new Node();
        char value = pre.charAt(0);
        node.setValue(value);
        int leftIndex = middle.indexOf(value);
        if(leftIndex!=0){
            node.setLeft(pm2t(pre.substring(1,leftIndex+1),middle.substring(0,leftIndex)));
        }
        if(leftIndex!=middle.length()-1){
            node.setRight(pm2t(pre.substring(leftIndex+1),middle.substring(leftIndex+1)));
        }
        return node;
    }
    public String t2p(Node node,String str){
        if(node.getLeft()!=null)
            str = t2p(node.getLeft(),str);
        if(node.getRight()!=null)
            str = t2p(node.getRight(),str);
        return str+node.getValue();
        
    }
    public void pm2p(String pre,String middle){
        Node node = pm2t(pre,middle);
        System.out.println(t2p(node,""));
    }
    public static void main(String[] args){
        String pre = "stuwv";
        String middle = "uwtvs";        
        new Test5().pm2p(pre,middle);
    }
}