meghakorade16
BAN USERThe simplest way of solving this problem:
step 1: sort the array by considering absolute values.
step 2: Add first two elements of the sorted array.
code-
{
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] numbers=new int[n];
for(int i=0;i<n;i++)
{
numbers[i]=in.nextInt();
}
int temp;
for (int i = 0; i < n; i++)
{
for (int j = i + 1; j < n; j++)
{
if (Math.abs(numbers[i]) > Math.abs(numbers[j]))
{
temp = numbers[i];
numbers[i] = numbers[j];
numbers[j] = temp;
}
}
}
int answer=numbers[0]+numbers[1];
System.out.print(" "+answer);
}
The simplest way of solving this problem:
- meghakorade16 March 02, 2016step 1: sort the array by considering absolute values.
step 2: Add first two elements of the sorted array.
code-
{
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] numbers=new int[n];
for(int i=0;i<n;i++)
{
numbers[i]=in.nextInt();
}
int temp;
for (int i = 0; i < n; i++)
{
for (int j = i + 1; j < n; j++)
{
if (Math.abs(numbers[i]) > Math.abs(numbers[j]))
{
temp = numbers[i];
numbers[i] = numbers[j];
numbers[j] = temp;
}
}
}
int answer=numbers[0]+numbers[1];
System.out.print(" "+answer);
}