-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathProblem-5.java
50 lines (36 loc) · 869 Bytes
/
Problem-5.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
41
42
43
44
45
46
47
48
49
50
/**
* @author AkashGoyal
* @date 24/05/2021
*/
/**
--------------------- Problem----------->> Move all negative elements to end
Problem Link :- https://practice.geeksforgeeks.org/problems/move-all-negative-elements-to-end1813/1
*/
class Solution {
public void segregateElements(int arr[], int n)
{
// Your code goes here
int arrcopy[]=new int[n];
int k=0;
for(int i=0;i<n;i++)
{
if(arr[i]>=0)
{
arrcopy[k]=arr[i];
k++;
}
}
for(int i=0;i<n;i++)
{
if(arr[i]<0)
{
arrcopy[k]=arr[i];
k++;
}
}
for(int i=0;i<n;i++)
{
arr[i]=arrcopy[i];
}
}
}