-
Notifications
You must be signed in to change notification settings - Fork 4
/
sortByHeight.cpp
47 lines (40 loc) · 1.16 KB
/
sortByHeight.cpp
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
/*
Some people are standing in a row in a park. There are trees between them which cannot be moved. Your task is to rearrange the people by their heights in a non-descending order without moving the trees.
Example
For a = [-1, 150, 190, 170, -1, -1, 160, 180], the output should be
sortByHeight(a) = [-1, 150, 160, 170, -1, -1, 180, 190].
*/
int replacer(std::vector<int> a, int pozition)
{
for(int i = pozition+1; i<a.size(); i++)
if(a[i]!=-1)
return i;
return pozition+1;
}
std::vector<int> sortByHeight(std::vector<int> a) {
bool sort = false;
int temp;
int pozition;
while(sort != true)
{
sort = true;
for(int i=0; i<a.size()-1; i++)
{
if(a[i] == -1)
continue;
pozition = replacer(a,i);
if(a[i]>a[pozition])
{
temp = a[i];
a[i] = a[pozition];
a[pozition] = temp;
sort = false;
}
}
}
return a;
}
//
// Created by Muhamed Karajic on February 13, 2018.
// Copyright © 2018 Muhamed Karajic. All rights reserved.
//