Question

5.10. sameContents: this method takes one input parameters of type ThingSortedArrayBag. The method then returns true if the input bag includes the same elements as the current bag even if the count of each element may be different from one bag to the other. For example, the method should return true for the following two bags of integers. The method returns false otherwise. [1,1,2,2,3] and [1,2,3]
please write in java

Answer 1

The code for the above question is :-

import java.util.*;

public class abc {

    public static void main(String[] args) { // this is the main method

        Scanner sc = new Scanner(System.in); // this is the scanner class to take input

        System.out.println("Enter the number of elements in sorted array bag");

        int n2 = sc.nextInt();

        System.out.println("Enter the elements");

        int sortedBag[] = new int[n2];

        for (int i = 0; i < n2; i++) { // taking the sortedbag input

            sortedBag[i] = sc.nextInt();}

        boolean result = sameContents(sortedBag); // and then calling the reuired method

        System.out.println(result);

    }

    public static boolean sameContents(int sortedBag[]) { // required method

        System.out.println("Enter the number of elements in current bag");

        Scanner sc = new Scanner(System.in);

        int n1 = sc.nextInt();

        System.out.println("Enter the elements"); // then I am taking the current bag elements

        int currentBag[] = new int[n1];

        for (int i = 0; i < n1; i++) {currentBag[i] = sc.nextInt();}

        HashMap<Integer, Integer> cBag = new HashMap<>(); // to compare two array I have used hashmap.

        for (int i = 0; i < currentBag.length; i++) { // First of all I have checked if that element is there or not in hashmap

            if (cBag.containsKey(currentBag[i])) { // if it is already then i have just increased the number by 1

                cBag.put(currentBag[i], cBag.get(currentBag[i]) + 1); // else i have initialised with 1

            } else {

                cBag.put(currentBag[i], 1);

            }

        }

        HashMap<Integer, Integer> sBag = new HashMap<>(); // then i have used the same concept with the sortedbag

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

            if (sBag.containsKey(sortedBag[i])) {

                sBag.put(sortedBag[i], sBag.get(sortedBag[i]) + 1);

            } else {

                sBag.put(sortedBag[i], 1);

            }

        }

        boolean result = cBag.keySet().equals(sBag.keySet()); // at last I have simply checked if both are equal or not

        return result;

    }

}

for better understanding please go through the screenshot

The output is below:-

THANK YOU