LeetCode-Answer/135.分发糖果.cpp at master · zhangjunxiongjie/LeetCode-Answer · 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
/*
 * @lc app=leetcode.cn id=135 lang=cpp
 *
 * [135] 分发糖果
 */

// @lc code=start
class Solution {
public:
    // 时间复杂度较差。
    int candy(vector<int>& ratings) {
        int result = 0;
        if (ratings.size() == 0)
        {
            return 0;
        }
        else if (ratings.size() == 1)
        {
            return 1;
        }

        int buffer[ratings.size()];
        for (int i = 0; i < ratings.size(); i++)
        {
            buffer[i] = 0;
        }

        if(ratings.at(0) <= ratings.at(1))
        {
            buffer[0] = 1;
        }
        if(ratings.at(ratings.size() - 1) <= ratings.at(ratings.size() - 2))
        {
            buffer[ratings.size() - 1] = 1;
        }

        for (int i = 1; i < ratings.size() - 1; i++)
        {
            if (ratings.at(i - 1) >= ratings.at(i) && ratings.at(i) <= ratings.at(i + 1))
            {
                buffer[i] = 1;
            }
        }

        for (int i = 0; i < ratings.size(); i++)
        {
            if (buffer[i] == 1)
            {
                int tier = 1;
                int x = i;
                while (0 <= x - 1 && ratings.at(x - 1) > ratings.at(x))
                {
                    tier++;
                    if (buffer[x - 1] < tier)
                    {
                        buffer[x - 1] = tier;
                    }
                    x--;
                }
                tier = 1;
                x = i;
                while (x + 1 < ratings.size() && ratings.at(x + 1) > ratings.at(x))
                {
                    tier++;
                    if (buffer[x + 1] < tier)
                    {
                        buffer[x + 1] = tier;
                    }
                    x++;
                }
            }
        }

        for (int i = 0; i < ratings.size(); i++)
        {
            result += buffer[i];
        }

        return result;
    }
};
// @lc code=end