-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMoveZeroes.java
More file actions
79 lines (68 loc) · 1.89 KB
/
MoveZeroes.java
File metadata and controls
79 lines (68 loc) · 1.89 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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
import java.util.Scanner;
public class MoveZeroes {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("Enter the size of an array: ");
int n = sc.nextInt();
System.out.println("Enter the array elements:");
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = sc.nextInt();
}
System.out.println("Original array:");
for (int ele : arr) {
System.out.print(ele + " ");
}
move(arr);
System.out.println("\nModified array:");
for (int ele : arr) {
System.out.print(ele + " ");
}
sc.close();
}
public static void move(int[] arr) {
int nonZero = 0;
for (int i = 0; i < arr.length; i++) {
if (arr[i] != 0) {
arr[nonZero++] = arr[i];
}
}
while (nonZero < arr.length) {
arr[nonZero++] = 0;
}
}
public static void merge(int[] arr, int low, int mid, int high) {
int[] temp = new int[high - low + 1];
int i = low, j = mid + 1, k = 0;
while (i <= mid && j <= high) {
if (arr[i] != 0) {
temp[k++] = arr[i++];
} else {
i++;
}
if (arr[j] != 0) {
temp[k++] = arr[j++];
} else {
j++;
}
}
while (i <= mid) {
if (arr[i] != 0) {
temp[k++] = arr[i];
}
i++;
}
while (j <= high) {
if (arr[j] != 0) {
temp[k++] = arr[j];
}
j++;
}
while (k < temp.length) {
temp[k++] = 0;
}
for (i = low; i <= high; i++) {
arr[i] = temp[i - low];
}
}
}