path: root / Practicum / pract06 / solutions / Task 02.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
48

#include <string>
#include <stack>
#include <vector>

class Solution
{
public:
    std::vector<int> asteroidCollision(std::vector<int> &asteroids)
    {
        std::stack<int> stack;

        for (int i = 0; i < asteroids.size(); ++i)
        {
            if (asteroids[i] > 0 || (stack.size() && stack.top() < 0))
            {
                stack.push(asteroids[i]);
                continue;
            }

            bool addNeg = true;
            while (stack.size() && stack.top() > 0 && stack.top() + asteroids[i] <= 0)
            {
                if (stack.top() + asteroids[i] == 0)
                {
                    stack.pop();
                    addNeg = false;
                    break;
                }
                stack.pop();
            }

            if (addNeg && (stack.empty() || stack.top() < 0))
            {
                stack.push(asteroids[i]);
            }
        }

        int idx = stack.size();
        std::vector<int> result(idx);
        while (stack.size())
        {
            result[--idx] = stack.top();
            stack.pop();
        }

        return result;
    }
};