Skip to content

Instantly share code, notes, and snippets.

@thmain
Last active May 25, 2018
Embed
What would you like to do?
import java.util.*;
public class SumCloseToZero {
public int findSum(int [] a){
Arrays.sort(a);
int i=0;
int j = a.length-1;
int positiveClose = Integer.MAX_VALUE;
int negativeClose = Integer.MIN_VALUE;
while(i<j){
int temp = a[i] + a[j];
//check if temp is greater than 0
if(temp>0){
//check if positiveClose needs to be updated
if(positiveClose>temp){
positiveClose = temp;
}
//decrement j, in order to reduce the difference, close to 0
j--;
}else if(temp<0){
//check if negative needs to be updated
if(negativeClose<temp){
negativeClose = temp;
}
//increment i, in order to reduce the difference, close to 0
i++;
}else{
//means temp is 0, that is the closest to zero we can get, return 0
return 0;
}
}
//check the least absolute value in postiveClose and negativeClose
return Math.min(Math.abs(positiveClose), Math.abs(negativeClose));
}
public static void main(String[] args) {
int a [] = {1, 4, -5, 3, -2, 10, -6, 20};
int closestSum = new SumCloseToZero().findSum(a);
System.out.println("Sum close to zero in the given array is : " + closestSum);
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment