Given an array of pairs containing length and breadth of rectangles. The task is to find the maximum area of the rectangle. Examples:
Input: (1, 2), (3, 5), (1, 1), (4, 2) Output: 15 Input: (3, 5), (5, 5), (9, 10) Output: 90
Approach:
- Use user defined Pair class to store Breadth and Height of rectangles.
- Make an array of this class.
- Now, traverse the array and find the area each time. Also, keep track of maximum area.
- Return the maximum area of rectangle.
Java
// Java code to find maximum Area import java.io.*; import java.util.*; // Pair class class Rectangle { // length and int length; int breadth; // Rectangle Constructor public Rectangle(int x, int y) { this.length = x; this.breadth = y; } } // Class Area to calculate Area of rectangles class Area { // Function to calculate area static int calculate_Area(Rectangle arr[]) { int max_Area = Integer.MIN_VALUE; // loop to iterate through all rectangles // and keep track of max area for (int i = 0; i < arr.length; i++) { int temp_area = arr[i].length * arr[i].breadth; if (temp_area > max_Area) { max_Area = temp_area; } } return max_Area; } } // Driver class with main function class GFG { // Driver code public static void main(String[] args) { Scanner sc = new Scanner(System.in); // Creating an array of Pair Rectangle arr[] = new Rectangle[3]; int x = 10, y = 20; arr[0] = new Rectangle(x, y); x = 5; y = 25; arr[1] = new Rectangle(x, y); x = 15; y = 10; arr[1] = new Rectangle(x, y); x = 12; y = 12; arr[2] = new Rectangle(x, y); Area obj = new Area(); System.out.println(obj.calculate_Area(arr)); } } |
Output:
200
Time complexity: O(n)
Auxiliary Space: O(1)
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
