leetcode 699. Falling Squares 俄罗斯方块的最高高度 + 暴力遍历即可
2017-12-25 14:42
411 查看
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]
Explanation:
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.
Note:
1 <= positions.length <= 1000.
1 <= positions[i][0] <= 10^8.
1 <= positions[i][1] <= 10^6.
本题题意很简单,就是在一个一维的坐标轴上,依次从高处扔箱子,求箱子的最大的高度,直接暴力遍历即可
就是每当落入一个方块的时候,直接遍历求解最高的高度,
在求解最高高度的时候,就是寻找公共区间来判断最高高度,这个就很简单了
代码如下:
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]
Explanation:
After the first drop of positions[0] = [1, 2]:
_aa _aa -------
The maximum height of any square is 2.
After the second drop of positions[1] = [2, 3]:
__aaa __aaa __aaa _aa__ _aa__ --------------
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]:
__aaa __aaa __aaa _aa _aa___a --------------
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.
Note:
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 { public: 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); res.push_back(h); } 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]) continue; maxHeight = max(maxHeight, i[2]); } one[2] += maxHeight; all.push_back(one); return one[2]; } };
相关文章推荐
- leetcode 697. Degree of an Array 等于数组的阶的最短的数组 + 遍历即可
- leetcode 443. String Compression 压缩字符串+暴力遍历
- leetcode 459. Repeated Substring Pattern 重复子串的确定 + 不需要寻找重复出现的子串 + 暴力拼接即可
- leetcode 149. Max Points on a Line 计算斜率的问题 + 直接暴力求解即可
- leetcode 598. Range Addition II 范围内的操作 + 遍历即可
- leetcode 717. 1-bit and 2-bit Characters 编码判断问题 + 贪心算法 + 遍历即可
- leetcode 459. Repeated Substring Pattern 暴力拆分即可
- leetcode 498. Diagonal Traverse 矩阵对角遍历 + 控制方向即可
- leetcode 463. Island Perimeter 周长统计 + 暴力统计即可
- LeetCode: 103_Binary Tree Zigzag Level Order Traversal | 二叉树Zigzag层次遍历 | Medium
- 二叉树常用操作(创建、查找、求高度、遍历、打印)
- Binary Tree Zigzag Level Order Traversal (LeetCode) 层序遍历二叉树
- LeetCode 94. Binary Tree Inorder Traversal 树的前序、中序,后序遍历的非递归实现
- 【LeetCode】Binary Tree Level Order Traversal--(二叉树层序遍历)
- [LeetCode] Nonrecursive postorder traversal 非递归后续遍历
- LeetCode-30-Substring with Concatenation of All Words 暴力+Map灵活数据结构
- leetcode 101. Symmetric Tree BFS广度优先遍历+DFS深度优先遍历
- LeetCode 347. Top K Frequent Elements - 频率最高的k个数
- leetcode 97. Interleaving String(字符串交错出现) DFS深度优先遍历 + 很明显很经典的DP动态规划做法
- Leetcode 之BFS广度优先遍历