-
Notifications
You must be signed in to change notification settings - Fork 0
/
Q4Sort012Array
47 lines (41 loc) · 808 Bytes
/
Q4Sort012Array
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
package com.java.rohit;
/******************************************************************************
https://practice.geeksforgeeks.org/problems/sort-an-array-of-0s-1s-and-2s/0
*******************************************************************************/
import java.util.*;
public class Q4Sort012Array
{
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int arr[]=new int[n];
for(int i=0;i<n;i++) {
arr[i]=sc.nextInt();
}
int low=0,mid=0,high=0;
int i;
for(i=0;i<n;i++) {
if(arr[i]==0)
low++;
else if(arr[i]==1)
mid++;
else
high++;
}
i=0;
while (low > 0) {
arr[i++] = 0;
low--;
}
while (mid > 0) {
arr[i++] = 1;
mid--;
}
while (high > 0) {
arr[i++] = 2;
high--;
}
for(int j=0;j<n;j++)
System.out.print(arr[j]);
}
}