leetcode 699. Falling Squares 俄罗斯方块的最高高度 + 暴力遍历即可

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/JackZhang_123/article/details/78892628

On an infinite number line (x-axis), we drop given squares in the order they are given.

The i-th square dropped (positions[i] = (left, side_length)) is a square with the left-most point being positions[i][0] and sidelength positions[i][1].

The square is dropped with the bottom edge parallel to the number line, and from a higher height than all currently landed squares. We wait for each square to stick before dropping the next.

The squares are infinitely sticky on their bottom edge, and will remain fixed to any positive length surface they touch (either the number line or another square). Squares dropped adjacent to each other will not stick together prematurely.

Return a list ans of heights. Each height ans[i] represents the current highest height of any square we have dropped, after dropping squares represented by positions[0], positions[1], …, positions[i].

Example 1:
Input: [[1, 2], [2, 3], [6, 1]]
Output: [2, 5, 5]

After the first drop of positions[0] = [1, 2]:


The maximum height of any square is 2.

After the second drop of positions[1] = [2, 3]:


The maximum height of any square is 5.
The larger square stays on top of the smaller square despite where its center
of gravity is, because squares are infinitely sticky on their bottom edge.

After the third drop of positions[1] = [6, 1]:


The maximum height of any square is still 5.

Thus, we return an answer of [2, 5, 5].

Example 2:
Input: [[100, 100], [200, 100]]
Output: [100, 100]
Explanation: Adjacent squares don’t get stuck prematurely - only their bottom edge can stick to surfaces.

1 <= positions.length <= 1000.
1 <= positions[i][0] <= 10^8.
1 <= positions[i][1] <= 10^6.




#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <climits>
#include <algorithm>
#include <sstream>
#include <functional>
#include <bitset>
#include <numeric>
#include <cmath>
#include <regex>

using namespace std;

class Solution 
    vector<int> fallingSquares(vector<pair<int, int>>& pos) 
        vector<int> res;
        vector<vector<int>> all;
        int h = 0;
        for (auto p : pos)
            vector<int> one = { p.first,p.first + p.second - 1,p.second };
            int tmp = getHeight(all,one);
            h = max(h, tmp);
        return res;

    int getHeight(vector<vector<int>>& all, vector<int>& one)
        int left = one[0], right = one[1];
        int maxHeight = 0;
        for (auto i : all)
            if (left > i[1] || right < i[0])
            maxHeight = max(maxHeight, i[2]);
        one[2] += maxHeight;
        return one[2];