699. Falling Squares

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]: _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.

  • import java.util.ArrayList;
    import java.util.List;
    
    /*
     * 有可能也会粘到右边。。。。
     * 貌似照搬473不行,key用int好像是不够的
     * 
     * 直接naive的O(N^2)
     */
    class Solution {
        public List<Integer> fallingSquares(int[][] positions) {
        	List<Integer> ret = new ArrayList<Integer>();
        	List<int[]> intervals = new ArrayList<int[]>();
        	int h = 0;
        	for(int[] pos : positions) {
        		int[] cur = new int[]{pos[0], pos[0]+pos[1]-1, pos[1]};
        		h = Math.max(h, getHeight(intervals, cur));	// 新加的interval可能并不能得到更高的高度
        		ret.add(h);
        	}
        	return ret;
        }
    
    	private int getHeight(List<int[]> intervals, int[] cur) {
    		int touchMaxHeight = 0;
    		for(int[] interval : intervals) {
    			if(interval[1] < cur[0])	continue;
    			if(interval[0] > cur[1])	continue;
    			touchMaxHeight = Math.max(touchMaxHeight, interval[2]);
    		}
    		cur[2] += touchMaxHeight;
    		intervals.add(cur);
    		return cur[2];
    	}
    }


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值