分治解决假硬币问题

package testing_03;

import java.util.Scanner;

/*
 *假硬币问题
 * high,low,n; 
 * */

public class test_13 {
    //static final int MAXNUM=30;
    static int FalseCoin(int coin[],int low,int high){
        int i,sum1,sum2,sum3;
        int re=0;
        sum1=sum2=sum3=0;
        if(low+1==high){
            if(coin[low]<coin[high]){
                re=low+1;
                return re;
            }
            else{
                re=high+1;
                return re;
            }
        }
        if((high-low+1)%2==0){
            for(i=low;i<low+(high-low)/2;i++){
                sum1=sum1+coin[i];
            }
            for(i=low+(high-low)/2+1;i<=high;i++){
                sum2=sum2+coin[i];
            }
            if(sum1>sum2){
                re=FalseCoin(coin,low+(high+low)/2+1,high);
                return re;
            }
            if(sum1<sum2){
                re=FalseCoin(coin,low,low+(high-low)/2);
                return re;
            }
            else{}
        }
        else{
            for(i=low;i<=low+(high-low)/2-1;i++){
                sum1=sum1+coin[i];
            }
            for(i=low+(high-low)/2+1;i<=high;i++){
                sum2=sum2+coin[i];
            }
            sum3=coin[low+(high-low)/2];
            if(sum1>sum2){
                re=FalseCoin(coin,low+(high-low)/2+1,high);
                return re;
            }
            else if(sum1<sum2){
                re=FalseCoin(coin,low,low+(high-low)/2-1);
                return re;
            }
            else{}
            if(sum1+sum3==sum2+sum3){
                re=low+(high-low)/2+1;
                return re;
            }
        }
        return re;
    }
    public static void main(String[] args) {
        // TODO Auto-generated method stub

        System.out.println("分治算法求解假硬币问题");
        System.out.println("请输入硬币的总数:");
        Scanner input=new Scanner(System.in);
       int  n=input.nextInt();
        int [] coin=new int[n];
        int i;
        int weizhi;
        System.out.println("请输入硬币的真假:");
        for(i=0;i<n;i++){
            coin[i]=input.nextInt();
        }
        weizhi=FalseCoin(coin,0,n-1);
        System.out.println("在上述"+n+"中"+"第"+weizhi+"是假币");
    }

}
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/kaishihaohaozuoshi/article/details/53996181
个人分类: java常用算法手册
上一篇Java需要达到的25个目标
下一篇穷举求解鸡兔同笼问题
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭