cppAlgorithms/d3.cpp at main · RozForCode/cppAlgorithms · GitHub

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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
#include <vector>
#include <iostream>
#include <climits>
using namespace std;

// First negative number in window of size K
vector<int> answer1(const vector<int> arr, int K)
{
    int n = arr.size();
    vector<int> negatives;
    vector<int> result;
    for (int i = 0; i < K; i++)
    {
        if (arr[i] < 0)
        {
            negatives.push_back(arr[i]);
        }
    }
    for (int i = K; i < n; i++)
    {
        if (negatives.size() == 0)
        {
            result.push_back(0);
        }
        else
        {

            result.push_back(negatives.front());
        }

        if (arr[i] < 0)
        {
            negatives.push_back(arr[i]);
        }
        if (arr[i - K] < 0)
        {
            negatives.erase(negatives.begin());
        }
    }
    return result;
}

// revision of answer on day4

vector<int> answer(const vector<int> arr, int k)
{
    vector<int> negatives;
    vector<int> result;
    int n = arr.size();

    for (int i = 0; i < k; i++)
    {
        if (arr[i] < 0)
        {
            negatives.push_back(arr[i]);
        }
    }
    for (int i = k; i < n; i++)
    {
        if (negatives.size() == 0)
        {
            result.push_back(0);
        }
        else
        {
            result.push_back(negatives.front());
        }
        if (arr[i] < 0)
        {
            negatives.push_back(arr[i]);
        }
        if (arr[i - k] < 0)
        {
            negatives.erase(negatives.begin());
        }
    }
    return result;
}

// incorrect - doesn't take care of window without negative
vector<int> revision(const vector<int> arr, int k)
{
    int n = arr.size();
    vector<int> negatives;
    vector<int> result;

    for (int i = 0; i < n; i++)
    {
        if (arr[i] < 0)
        {
            negatives.push_back(arr[i]);
        }
    }
    for (int i = 0; i < n - k + 1; i++)
    {
        result.push_back(negatives[i]);
    }
    return result;
}

// to correct implement we need to do first window in separate loop
vector<int> revision1(const vector<int> arr, int k)
{
    int n = arr.size();
    vector<int> negatives;
    vector<int> result;

    for (int i = 0; i < k; i++)
    {
        if (arr[i] < 0)
        {
            negatives.push_back(arr[i]);
        }
    }
    for (int i = k; i < n; i++)
    {
        if (negatives.size() == 0)
        {
            result.push_back(0);
        }
        else
        {
            result.push_back(negatives.front());
        }
        if (arr[i] < 0)
        {
            negatives.push_back(arr[i]);
        }
        if (arr[i - k] < 0)
        {
            negatives.erase(negatives.begin());
        }
    }
    return result;
}

// push_back, erase(pointer), begin()->iterator,end(), front()->value, back(), size(), empty()
// pop_back(), reverse(.begin(),.end()), sort(.begin(),.end());

// 2 vectors - neg and result, fill neg one loop for k; next loop- remove n.front() if i-k < 0, if neg.size()!=0; add to result;
//