Day 14: Scope - HackerRank 30 days of code solution

Objective
Today we're discussing scope.

---

The absolute difference between two integers,  and , is written as . The maximum absolute difference between two integers in a set of positive integers, , is the largest absolute difference between any two integers in .

The Difference class is started for you in the editor. It has a private integer array () for storing  non-negative integers, and a public integer () for storing the maximum absolute difference.

Task
Complete the Difference class by writing the following:

• A class constructor that takes an array of integers as a parameter and saves it to the  instance variable.
• A computeDifference method that finds the maximum absolute difference between any  numbers in  and stores it in the  instance variable.

Input Format

You are not responsible for reading any input from stdin. The locked Solution class in your editor reads in  lines of input; the first line contains , and the second line describes the  array.

Constraints

• , where 

Output Format

You are not responsible for printing any output; the Solution class will print the value of the  instance variable.

Sample Input

3
1 2 5

Sample Output

4

Explanation

The scope of the  array and  integer is the entire class instance. The class constructor saves the argument passed to the constructor as the  instance variable (where the computeDifference method can access it).

To find the maximum difference, computeDifference checks each element in the array and finds the maximum difference between any  elements: 

The maximum of these differences is , so it saves the value  as the  instance variable. The locked stub code in the editor then prints the value stored as , which is .

Solution :

import java.io.*;

import java.util.*;

import java.text.*;

import java.math.*;

import java.util.regex.*;

class Difference {

  private int[] elements;

  public int maximumDifference;

Difference(int [] elements){

        this.elements = elements ;

    }

    public void computeDifference(){

        int diff = 0 ,maximumDifference1  = 0;

           for(int i = 0 ; i < elements.length ; i++){

               for(int j = i+1 ; j < elements.length ; j++){

                   diff = Math.abs(elements[i] - elements[j]);

                   if(maximumDifference1 < diff){

                       maximumDifference1 = diff ;

                   }

               }

           }

            maximumDifference = maximumDifference1;

    }

}

public class Solution {

    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();

        int[] a = new int[n];

        for (int i = 0; i < n; i++) {

            a[i] = sc.nextInt();

        }

        sc.close();

        Difference difference = new Difference(a);

        difference.computeDifference();

        System.out.print(difference.maximumDifference);

    }

}