-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathProblem26.java
More file actions
55 lines (55 loc) · 1.5 KB
/
Problem26.java
File metadata and controls
55 lines (55 loc) · 1.5 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
import java.util.Scanner;
import java.util.ArrayList;
public class Problem26{
// Remove Duplicates from Sorted Array
public static void main(String[] args) {
Scanner obj=new Scanner(System.in);
String input=obj.nextLine();
String inputArray[]=input.split(" ");
int nums[]=new int[inputArray.length];
for(int i=0;i<inputArray.length;i++){
nums[i]=Integer.parseInt(inputArray[i]);
}
// Method 1
int k=Solution26A.removeDuplicates(nums);
System.out.println(k);
for(int i=0;i<k;i++){
System.out.print(nums[i]+" ");
}
System.out.println();
// Method 2
int p=Solution26B.removeDuplicates(nums);
System.out.println(p);
for(int i=0;i<p;i++){
System.out.print(nums[i]+" ");
}
System.out.println();
obj.close();
}
}
class Solution26A{
public static int removeDuplicates(int nums[]){
int j=1;
for(int i=1;i<nums.length;i++){
if(nums[i-1]!=nums[i]){
nums[j]=nums[i];
j++;
}
}
return j;
}
}
class Solution26B{
public static int removeDuplicates(int nums[]){
ArrayList<Integer> list=new ArrayList<>();
for(int num : nums){
if(!(list.contains(num))){
list .add(num);
}
}
for(int i=0;i<list.size();i++){
nums[i]=list.get(i);
}
return list.size();
}
}