From f88ec70a8f56f1d4e7ecf28b0062d46b82f8b030 Mon Sep 17 00:00:00 2001 From: Mohammad S Anwar Date: Tue, 23 May 2023 19:56:21 +0100 Subject: - Added solutions by Mark Anderson. - Added solutions by Stephen G. Lynn. - Added solutions by David Ferrone. - Added solutions by Thomas Kohler. - Added solutions by Niels van Dijke. - Added solutions by W. Luis Mochan. - Added solutions by Steven Wilson. - Added solutions by Robert DiCicco. - Added solutions by Lubos Kolouch. --- challenge-218/ziameraj16/java/MaximumProduct.java | 26 +++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 challenge-218/ziameraj16/java/MaximumProduct.java (limited to 'challenge-218/ziameraj16/java/MaximumProduct.java') diff --git a/challenge-218/ziameraj16/java/MaximumProduct.java b/challenge-218/ziameraj16/java/MaximumProduct.java new file mode 100644 index 0000000000..66c8277c82 --- /dev/null +++ b/challenge-218/ziameraj16/java/MaximumProduct.java @@ -0,0 +1,26 @@ +import java.util.*; + +public class MaximumProduct { + + public static void main(String[] args) { + Scanner scanner = new Scanner(System.in); + List values = Arrays.stream(scanner.nextLine().split(",")).map(Integer::valueOf).toList(); + int maxProduct = 0; + String str = null; + int size = values.size(); + for (int x = 0; x < size - 2; x++) { + for (int y = x + 1; y < size - 1; y++) { + for (int z = y + 1; z < size; z++) { + Integer first = values.get(x); + Integer second = values.get(y); + Integer third = values.get(z); + if (first * second * third > maxProduct) { + maxProduct = first * second * third; + str = String.format("%s x %s x %s => %s", first, second, third, maxProduct); + } + } + } + } + System.out.println(str); + } +} -- cgit