it Language Java 8 Autocomplete Ready O 3. Closest Numbers 1 > import java.io.*; - 14 15 class Result { 16 Given an array of distinct integers, determine the minimum absolute difference between any two elements. Print all element pairs with that minimal absolute difference in ascending order. * Example numbers = [6,2,4,10] The minimal absolute difference is 2 and the pairs with that difference are (2,4) and (4,6). When printing element pairs (1) they should be ordered ascending first by i and then by j. 17 /* 18 * Complete the closest Numbers' function below. 19 20 * The function accepts INTEGER_ARRAY numbers as parameter. 21 */ 22 23 public static void closestNumbers (List numbers) { 24 // Write your code here 25 26 } 27 28 } 29 30 > public class Solution { 2 4 4 6 Function Description Complete the function closestNumbers in the editor below. closestNumbers has the following parameter(s): int numbers[n: an array of integers Returns: NONE Line: 14 Co Test Results Custom Input Run Code Run Tests Submit
it Language Java 8 Autocomplete Ready O 3. Closest Numbers 1 > import java.io.*; - 14 15 class Result { 16 Given an array of distinct integers, determine the minimum absolute difference between any two elements. Print all element pairs with that minimal absolute difference in ascending order. * Example numbers = [6,2,4,10] The minimal absolute difference is 2 and the pairs with that difference are (2,4) and (4,6). When printing element pairs (1) they should be ordered ascending first by i and then by j. 17 /* 18 * Complete the closest Numbers' function below. 19 20 * The function accepts INTEGER_ARRAY numbers as parameter. 21 */ 22 23 public static void closestNumbers (List numbers) { 24 // Write your code here 25 26 } 27 28 } 29 30 > public class Solution { 2 4 4 6 Function Description Complete the function closestNumbers in the editor below. closestNumbers has the following parameter(s): int numbers[n: an array of integers Returns: NONE Line: 14 Co Test Results Custom Input Run Code Run Tests Submit
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 3 images