-
Notifications
You must be signed in to change notification settings - Fork 0
/
Arranging the array
60 lines (48 loc) · 1.41 KB
/
Arranging the array
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
//{ Driver Code Starts
//Initial Template for Java
import java.util.*;
import java.lang.*;
import java.io.*;
class GFG {
public static void main(String[] args) throws IOException
{
BufferedReader br =
new BufferedReader(new InputStreamReader(System.in));
int t =
Integer.parseInt(br.readLine().trim()); // Inputting the testcases
while(t-->0)
{
int n = Integer.parseInt(br.readLine().trim());
int a[] = new int[n];
String inputLine[] = br.readLine().trim().split(" ");
for (int i = 0; i < n; i++) {
a[i] = Integer.parseInt(inputLine[i]);
}
Solution obj = new Solution();
obj.Rearrange(a, n);
StringBuilder output = new StringBuilder();
for(int i=0;i<n;i++)
output.append(a[i]+" ");
System.out.println(output);
}
}
}
// } Driver Code Ends
//User function Template for Java
class Solution {
public void Rearrange(int a[], int n)
{
// Your code goes here
ArrayList<Integer> temp = new ArrayList<>();
for(int i=0;i<n;i++){
if(a[i]<0)temp.add(a[i]);
}
for(int i=0;i<n;i++){
if(a[i]>=0)temp.add(a[i]);
}
int i=0;
for(int x:temp){
a[i++]=x;
}
}
}