-
Notifications
You must be signed in to change notification settings - Fork 0
/
Leetcode_practice.java
40 lines (36 loc) · 1.25 KB
/
Leetcode_practice.java
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
import java.util.ArrayList;
import java.util.Scanner;
class Remove {
void removeEle() {
ArrayList<Integer> num = new ArrayList<>();
System.out.println("Enter the size of the array : ");
try (Scanner sc = new Scanner(System.in)) {
int n = sc.nextInt();
System.out.println("Enter elements one by one:");
for (int i = 0; i < n; i++) {
int x = sc.nextInt();
num.add(x);
}
System.out.println("The entered array is : " + num);
System.out.print("Enter element to be removed : ");
int val = sc.nextInt();
for (int i = 0; i < n; i++) {
if (val == num.get(i)) {
num.remove(i);
--i; // decrement index because a gap created after removal
--n; // decrease count of remaining elements
num.add(0);
}
}
System.out.println("The entered array is : " + num);
}
}
}
public class Leetcode_practice {
public static void main(String[] args) {
// Testing the methods of the class.
// removing element in the array
Remove r = new Remove();
r.removeEle();
}
}