You are given an array x of n
positive numbers. You start at point (0,0)
and moves x[0]
metres to the north, then x[1]
metres to the west, x[2]
metres to the south, x[3]
metres to the east and so on. In other words, after each move your direction changes counter-clockwise.
Write a one-pass algorithm with O(1)
extra space to determine, if your path crosses itself, or not.
Example 1:
┌───┐
│ │
└───┼──>
│
Input: [2,1,1,2]
Output: true
Example 2:
┌──────┐
│ │
│
│
└────────────>
Input: [1,2,3,4]
Output: false
Example 3:
┌───┐
│ │
└───┼>
Input: [1,1,1,1]
Output: true
题目 检测是否会撞到自己。
我们可以分为3个状态处理:
- 第一阶段外旋转扩张。不可能碰壁
- 向内旋转换。可能碰壁
- 内旋。只需要检测倒数第一条边和倒数第3条边的长
剩下的就简单了,代码如下:
/*
@Author PaladinDu
*/
bool isSelfCrossing(int* x, int xSize){
/*
1.第一阶段外旋转扩张。不可能碰壁
2.向内旋转换。可能碰壁
3.内旋。只需要检测倒数第一条边和倒数第3条边的长
*/
for(int i = 3;i < xSize;++i){
if (x[i-1] <= x[i-3]){//进入第二阶段
if(x[i] >= x[i-2] ||(((i>=4 && x[i-1] == x[i-3] )||(i>=5 &&x[i-1]+x[i-5]>=x[i-3]) )&&x[i]+x[i-4]>=x[i-2])){//检测是否第二阶段撞墙
return true;
}
for(i = i+1;i < xSize;++i){//检测内旋是否碰壁
if(x[i] >= x[i-2]){
return true;
}
}
return false;
}
}
return false;
}