Closest Numbers
Problem Statement :
Sorting is useful as the first step in many different tasks. The most common task is to make finding things easier, but there are other uses as well. In this case, it will make it easier to determine which pair or pairs of elements have the smallest absolute difference between them. Note As shown in the example, pairs may overlap. Given a list of unsorted integers, arr , find the pair of elements that have the smallest absolute difference between them. If there are multiple pairs, find them all. Function Description Complete the closestNumbers function in the editor below. closestNumbers has the following parameter(s): int arr[n]: an array of integers Returns - int[]: an array of integers as described Input Format The first line contains a single integer n, the length of arr. The second line contains n space-separated integers, arr[i].
Solution :
Solution in C :
In C++ :
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
std::cin>>n;
std::vector<int>x;
int tmp;
int i;
for(i = 0; i<n; i++)
{
std::cin>>tmp;
x.push_back(tmp);
}
std::sort(x.begin(),x.end());
int diff = std::numeric_limits<int>::max();
int currentDiff = 0;
std::vector<int> start;
std::vector<int> end;
for(i = 0; i<n-1; i++)
{
currentDiff = x[i+1] - x[i];
if(currentDiff<diff)
{
diff=currentDiff;
while(!start.empty())
{
start.pop_back();
end.pop_back();
}
start.push_back(x[i]);
end.push_back(x[i+1]);
}
else if(currentDiff==diff)
{
start.push_back(x[i]);
end.push_back(x[i+1]);
}
}
for(i = 0; i<start.size(); i++)
{
std::cout<<start[i]<<" "<<end[i]<<" ";
}
return 0;
}
In Java :
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] dat = new int[n];
for(int i = 0; i < n; i++) {
dat[i] = in.nextInt();
}
Arrays.sort(dat);
int minDiff = Integer.MAX_VALUE;
String out = "";
for(int i = 0; i < n - 1; i++) {
if(dat[i + 1] - dat[i] <= minDiff) {
if(dat[i + 1] - dat[i] == minDiff) {
out += " " + dat[i] + " " + dat[i + 1];
} else {
out = dat[i] + " " + dat[i + 1];
}
minDiff = dat[i + 1] - dat[i];
}
}
System.out.println(out);
}
}
In C :
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#define ll long long int
int compare(const void *a,const void *b)
{
return (*(ll*)a-*(ll*)b);
}
int main()
{
ll n,i,a[200005],min;
scanf("%lld",&n);
for(i=0;i<n;i++)
{
scanf("%lld",&a[i]);
}
qsort(a,n,sizeof(ll),compare);
min=10000000;
for(i=0;i<n-1;i++)
{
if((a[i+1]-a[i])<min)
{
min=a[i+1]-a[i];
}
}
for(i=0;i<n-1;i++)
{
if((a[i+1]-a[i])==min)
{
printf("%lld %lld ",a[i],a[i+1]);
}
}
return 0;
}
In Python3 :
def main():
N = int(input())
ar = sorted(list(map(int, str(input()).split())))
prs = ''
mini = pow(10, 7) + 1
for i in range(1, N):
diff = abs(ar[i-1] - ar[i])
if (diff <= mini):
if (diff < mini):
prs = ''
mini = diff
prs += str(ar[i-1]) + ' ' + str(ar[i]) + ' '
print (prs)
if __name__ == '__main__':
main()
View More Similar Problems
Square-Ten Tree
The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the
View Solution →Balanced Forest
Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a
View Solution →Jenny's Subtrees
Jenny loves experimenting with trees. Her favorite tree has n nodes connected by n - 1 edges, and each edge is ` unit in length. She wants to cut a subtree (i.e., a connected part of the original tree) of radius r from this tree by performing the following two steps: 1. Choose a node, x , from the tree. 2. Cut a subtree consisting of all nodes which are not further than r units from node x .
View Solution →Tree Coordinates
We consider metric space to be a pair, , where is a set and such that the following conditions hold: where is the distance between points and . Let's define the product of two metric spaces, , to be such that: , where , . So, it follows logically that is also a metric space. We then define squared metric space, , to be the product of a metric space multiplied with itself: . For
View Solution →Array Pairs
Consider an array of n integers, A = [ a1, a2, . . . . an] . Find and print the total number of (i , j) pairs such that ai * aj <= max(ai, ai+1, . . . aj) where i < j. Input Format The first line contains an integer, n , denoting the number of elements in the array. The second line consists of n space-separated integers describing the respective values of a1, a2 , . . . an .
View Solution →Self Balancing Tree
An AVL tree (Georgy Adelson-Velsky and Landis' tree, named after the inventors) is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. We define balance factor for each node as : balanceFactor = height(left subtree) - height(righ
View Solution →