Write Java program. Write an algorithm that takes a sorted list of n integers and remove the duplicate elements from the list and return the new length. The algorithm must run in O(n) time and O(1) space. We assume that: List elements are inetger Input list is already sorted Sample example: INPUT: 1 1 2 2 3 3 4 4 5 5 5 6 7 67 OUTPUT: 8 - DriverMain.java: (Do not change anyparts of the given code, only add more code) import java.util.*; import java.util.stream.Collectors; import java.lang.*; import java.io.*; class DriverMain { public static void main(String args[]) { Scanner input = new Scanner(System.in); String str = input.nextLine(); input.close(); int[] arr = Arrays.stream(str.substring(0, str.length()).split("\\s")) .map(String::trim).mapToInt(Integer::parseInt).toArray(); List list = Arrays.stream(arr).boxed().collect(Collectors.toList()); Collections.sort(list); System.out.println(ProblemSolution.removeDuplicate(list)); } } - solution.java: import java.util.*; import java.util.stream.Collectors; import java.lang.*; import java.io.*; class ProblemSolution { public static int removeDuplicate(List list) { } }
********************Answer question below:*****************
Write Java program.
Write an
We assume that:
- List elements are inetger
- Input list is already sorted
Sample example:
INPUT:
1 1 2 2 3 3 4 4 5 5 5 6 7 67
OUTPUT:
8
- DriverMain.java:
(Do not change anyparts of the given code, only add more code)
import java.util.*;
import java.util.stream.Collectors;
import java.lang.*;
import java.io.*;
class DriverMain {
public static void main(String args[]) {
Scanner input = new Scanner(System.in);
String str = input.nextLine();
input.close();
int[] arr = Arrays.stream(str.substring(0, str.length()).split("\\s"))
.map(String::trim).mapToInt(Integer::parseInt).toArray();
List<Integer> list = Arrays.stream(arr).boxed().collect(Collectors.toList());
Collections.sort(list);
System.out.println(ProblemSolution.removeDuplicate(list));
}
}
- solution.java:
import java.util.*;
import java.util.stream.Collectors;
import java.lang.*;
import java.io.*;
class ProblemSolution {
public static int removeDuplicate(List<Integer> list) {
}
}
![](/static/compass_v2/shared-icons/check-mark.png)
Trending now
This is a popular solution!
Step by step
Solved in 2 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)