Find Minimum Difference Between Numbers In An Array Using Java

 package demo;


import java.util.Arrays;

import java.util.List;

import java.util.stream.Collectors;


public class MinimumDiff {


public static void main(String[] args) {


List<Integer> list = Arrays.asList(4, 4, -2, -1, 3);

List<Integer> sortedList = list.stream().distinct().sorted().collect(Collectors.toList());

int n1 = sortedList.size();


int min = Integer.MAX_VALUE;


for (int i = 0; i < n1 - 1; i++) {

int difference = sortedList.get(i + 1) - sortedList.get(i);


if (difference < min) {

min = difference;


}


}


for (int i = 0; i < n1 - 1; i++) {

if (Math.abs((sortedList.get(i + 1) - sortedList.get(i))) == min) {

System.out.println(sortedList.get(i) + " " + sortedList.get(i + 1));

}

}


}


}


Comments

Popular posts from this blog

3 Lines of Code And You Can Download Your Favourite Youtube Video.

Leetcode Problem(Easy) Roman to Integer

Leetcode : (Find Minimum in Rotated Sorted Array)