Write a method called kthLargest() that accepts an integer x and an array a of integers as its parameters. It should then return the elements that that k elements of greater or equal value. So if k = 0 return the largest element. If k = 1. return the second-largest element, and so on. Do not change the array itself, but you can make a copy if you want. Suggested approach make a COPY of the array. Sort the copy then find the kth element of the copy and return it. The original is left untouched! :) For example if array1 = {74, 85, 102, 99, 101, 56, 84} and the function kthLargest(2, array1) is called, then your method should return 99 because there are two values that are larger than 99. (101 and 102). If x is less than zero or greater than/equal to the the size of the array then return -9999; Make sure your main function works for the following public static void main(String[] args) { int[] array1 = {6, 8, 2, 3, 5, 12, 16, 1, 7, 4, 21, 19}; int answer = kthLargest(0,array1); System.out.println(answer); answer = kthLargest(1,array1); System.out.println(answer); answer = kthLargest(2,array1); System.out.println(answer); answer = kthLargest(10,array1); System.out.println(answer); answer = kthLargest(11,array1); System.out.println(answer); answer = kthLargest(-1,array1); System.out.println(answer); answer = kthLargest(20,array1); System.out.println(answer); }
Write a method called kthLargest() that accepts an integer x and an array a of integers as its parameters. It should then return the elements that that k elements of greater or equal value. So if k = 0 return the largest element. If k = 1. return the second-largest element, and so on. Do not change the array itself, but you can make a copy if you want.
- Suggested approach
- make a COPY of the array.
- Sort the copy
- then find the kth element of the copy and return it.
- The original is left untouched! :)
For example if array1 = {74, 85, 102, 99, 101, 56, 84} and the function kthLargest(2, array1) is called, then your method should return 99 because there are two values that are larger than 99. (101 and 102).
If x is less than zero or greater than/equal to the the size of the array then return -9999;
Make sure your main function works for the following
public static void main(String[] args){
int[] array1 = {6, 8, 2, 3, 5, 12, 16, 1, 7, 4, 21, 19};
int answer = kthLargest(0,array1);
System.out.println(answer);
answer = kthLargest(1,array1);
System.out.println(answer);
answer = kthLargest(2,array1);
System.out.println(answer);
answer = kthLargest(10,array1);
System.out.println(answer);
answer = kthLargest(11,array1);
System.out.println(answer);
answer = kthLargest(-1,array1);
System.out.println(answer);
answer = kthLargest(20,array1);
System.out.println(answer);
}
![](/static/compass_v2/shared-icons/check-mark.png)
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)