题目:
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:
Given x = [2, 1, 1, 2]
,
?????
? ?
???????>
?
Return true (self crossing)
Example 2:
Given x = [1, 2, 3, 4]
,
????????
? ?
?
?
?????????????>
Return false (not self crossing)
Example 3:
Given x = [1, 1, 1, 1]
,
?????
? ?
?????>
Return true (self crossing)
思路:
很绕的数学题。一种比较简单的思路就是判断图形是否一直处于螺旋增加状态或者螺旋减小状态,如果是的话就不会相交。螺旋增加的充要条件是对于i >=2,始终有x[i] > x[i - 2];螺旋减小就是对于x>=2,始终有x[i] < x[i - 2]。如果不能一直处于这两种状态的一种,那么还可以分为如下两种情况:
1)从螺旋减小再到螺旋增大,这种状态必然是相交的。
2)从螺旋增大再到螺旋减小,这种状态并不一定相交,但是会改变x[i-1]的边界条件:即我们需要判断x[i] + x[i - 4]是否比x[i-2]小,如果小的话,则x[i-1]的边界不会变;但是如果x[i] + x[i - 4] >= x[i-2],x[i-1]将会减小为x[i-1] - x[i-3]。
说起来很抽象很不好理解,建议画个图看看这几种情况^_^。
代码:
class Solution {
public:
bool isSelfCrossing(vector<int>& x) {
if(x.size() <= 3) {
return false;
}
bool flag = x[2] > x[0]; // to indicate increase or decrease
for(int i = 3; i < x.size(); ++i) {
if(!flag && x[i] >= x[i-2]) {
return true;
}
if(flag && x[i] <= x[i-2]) {
flag = false;
x[i-1] = (x[i] + (i >= 4 ? x[i-4] : 0)) < x[i-2] ? x[i-1] : (x[i-1] - x[i-3]);
}
}
return false;
}
};