diff options
author | Haidong Ji | 2018-08-06 22:15:40 -0500 |
---|---|---|
committer | Haidong Ji | 2018-08-06 22:15:40 -0500 |
commit | eb3a6e192072e9ddb82c5a9cf283196558d61e45 (patch) | |
tree | b41d22b922522e4c8d6099af27611fd6c0cfbc9c /AlgoDesignAndTechniqueEdxJava/sources | |
parent | d9978c0c13659c82ff288035474e485f6ee44c14 (diff) |
Maximum Pairwise Product done!
Diffstat (limited to 'AlgoDesignAndTechniqueEdxJava/sources')
-rw-r--r-- | AlgoDesignAndTechniqueEdxJava/sources/MaxPairProduct.java | 59 |
1 files changed, 59 insertions, 0 deletions
diff --git a/AlgoDesignAndTechniqueEdxJava/sources/MaxPairProduct.java b/AlgoDesignAndTechniqueEdxJava/sources/MaxPairProduct.java new file mode 100644 index 0000000..18b9521 --- /dev/null +++ b/AlgoDesignAndTechniqueEdxJava/sources/MaxPairProduct.java @@ -0,0 +1,59 @@ +import java.util.Scanner; + +public class MaxPairProduct { + int numberOfIntegers; + int biggest; + int bigger; + + public MaxPairProduct(int size) { + numberOfIntegers = size; + } + + public int getCount() { + return numberOfIntegers; + } + + public static void main(String[] args) { + Scanner s = new Scanner(System.in); + + int n = s.nextInt(); + MaxPairProduct mpp = new MaxPairProduct(n); + for (int i = 0; i<n; i++) { + mpp.newNumber(s.nextInt()); + } + + s.close(); + + System.out.println(mpp.getProduct()); + + } + + public int getBiggest() { + return biggest; + } + + public int getBigger() { + return bigger; + } + + public void newNumber(int i) { + if (i > biggest) { + bigger = biggest; + biggest = i; + } else if (i == biggest) { + bigger = i; + } else if (i > bigger) { + bigger = i; + } + } + + public long getProduct() { + if (numberOfIntegers == 0) { + return (long) 0; + } else if (numberOfIntegers == 1) { + return (long) biggest; + } + return (long) biggest * (long) bigger; + } + +} |