Self Crossing

最新推荐文章于 2021-10-29 21:46:01 发布

silenci

最新推荐文章于 2021-10-29 21:46:01 发布

阅读量518

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/popvip44/article/details/53940973

版权

leetcode 专栏收录该内容

145 篇文章 0 订阅

订阅专栏

有三种情况：螺旋扩大螺旋缩小先螺旋扩大再螺旋缩小

下面是第三种情况的示意图：

                                          +------------+
    +---------+                           |            |
    |         |                           |            |
    |         |                           |            |
    |         |                           |            |
    |       i-4  <----+                   |            |
i-2 |         |       |                   |            +
    |         |       |                   |
    |                 |i                  |
    |                 |                   |         <---------------+
    |                 |                   |                         |
    +---------+-------+                   |                         |
              ^                           |                         |
              |                           +-------------------------+
              |


    x[i] + x[i-4] >= x[i-2]                  x[i] + x[i-4] < x[i-2]
    Then, possible early collision,          nothing has to be changed
    pretend we have started from
    the plus sign point

class Solution
{
public:
	bool isSelfCrossing(vector<int>& x)
	{
		x.insert(x.begin(), 4, 0);

		int len = x.size();
		int i = 4;

		// outer spiral
		for (; i < len && x[i] > x[i - 2]; i++);

		if (i == len) return false;

		// check border
		if (x[i] >= x[i - 2] - x[i - 4])
		{
			x[i - 1] -= x[i - 3];
		}

		// inner spiral
		for (i++; i < len && x[i] < x[i - 2]; i++);

		return i != len;
	}
};