zoukankan      html  css  js  c++  java
  • Java解12球称重问题

    package algs;
    
    /**
     * Author: areful
     * Date: 2018/8/7
     */
    public class TwelveBalls {
        public static void main(String[] args) {
            for (int i = 0; i < 12; i++) {
                int[] data = new int[12];
                data[i] = 1;
                assert i == findWhich(data);
            }
        }
    
        private static int findWhich(int[] a) {
            if (a.length != 12) throw new RuntimeException("data size must be 12");
    
            if (sum(a[0], a[1], a[2], a[3]) == sum(a[4], a[5], a[6], a[7])) {
                if (sum(a[0], a[9]) == sum(a[10], a[11])) {
                    return 8;
                } else if (sum(a[0], a[9]) < sum(a[10], a[11])) {
                    if (sum(a[0], a[10]) == sum(a[1], a[11])) {
                        return 9;
                    } else if (sum(a[0], a[10]) < sum(a[1], a[11])) {
                        return 11;
                    } else if (sum(a[0], a[10]) > sum(a[1], a[11])) {
                        return 10;
                    }
                } else {
                    if (sum(a[0], a[10]) == sum(a[1], a[11])) {
                        return 9;
                    } else if (sum(a[0], a[10]) < sum(a[1], a[11])) {
                        return 10;
                    } else if (sum(a[0], a[10]) > sum(a[1], a[11])) {
                        return 11;
                    }
                }
            } else if (sum(a[0], a[1], a[2], a[3]) > sum(a[4], a[5], a[6], a[7])) {
                if (sum(a[0], a[5], a[6]) == sum(a[4], a[1], a[10])) {
                    if (sum(a[2], a[7]) == sum(a[11], a[9])) {
                        return 3;
                    } else if (sum(a[2], a[7]) > sum(a[11], a[9])) {
                        return 2;
                    } else {
                        return 7;
                    }
                } else if (sum(a[0], a[5], a[6]) > sum(a[4], a[1], a[10])) {
                    if (a[0] != a[8]) {
                        return 0;
                    } else {
                        return 4;
                    }
                } else {
                    if (sum(a[5], a[1]) == sum(a[9], a[10])) {
                        return 6;
                    } else if (sum(a[5], a[1]) > sum(a[9], a[10])) {
                        return 1;
                    } else {
                        return 5;
                    }
                }
            } else {
                if (sum(a[0], a[5], a[6]) == sum(a[4], a[1], a[10])) {
                    if (sum(a[2], a[7]) == sum(a[11], a[9])) {
                        return 3;
                    } else if (sum(a[2], a[7]) > sum(a[11], a[9])) {
                        return 7;
                    } else {
                        return 2;
                    }
                } else if (sum(a[0], a[5], a[6]) < sum(a[4], a[1], a[10])) {
                    if (a[0] != a[8]) {
                        return 0;
                    } else {
                        return 4;
                    }
                } else {
                    if (sum(a[5], a[1]) == sum(a[9], a[10])) {
                        return 6;
                    } else if (sum(a[5], a[1]) < sum(a[9], a[10])) {
                        return 1;
                    } else {
                        return 5;
                    }
                }
            }
    
            throw new RuntimeException("Should not be here.");
        }
    
        private static int sum(int... array) {
            int total = 0;
            for (int i : array) total += i;
            return total;
        }
    }
    

      

  • 相关阅读:
    项目管理【53】 | 项目风险管理-规划风险应对
    Learning a Continuous Representation of 3D Molecular Structures with Deep Generative Models
    转:DenseNet
    转:期刊投稿中的简写(ADM,AE,EIC等)与流程状态解读
    论文中如何写算法伪代码
    氨基酸,多肽,蛋白质等
    pytorch查看全连接层的权重和梯度
    AI制药文章
    long-tail datasets
    转:Focal Loss理解
  • 原文地址:https://www.cnblogs.com/areful/p/10381535.html
Copyright © 2011-2022 走看看