# Middle-题目123：335. Self Crossing

76人阅读 评论(0)

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)

public class Solution {
public boolean isSelfCrossing(int[] x) {
for(int i=3;i<x.length;i++){
if(i>=3&&x[i]>=x[i-2]&&x[i-1]<=x[i-3])
return true;
if(i>=4&&x[i-1]==x[i-3]&&x[i-2]<=x[i]+x[i-4])
return true;
if(i>=5&&x[i-2]>x[i-4]&&x[i-1]<=x[i-3]&&x[i-1]+x[i-5]>=x[i-3]&&x[i]+x[i-4]>=x[i-2])
return true;
}
return false;
}
}

0ms，beats 43.49%，众数0ms,56.51%
Cmershen的碎碎念：

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：56908次
• 积分：3213
• 等级：
• 排名：第10664名
• 原创：270篇
• 转载：53篇
• 译文：0篇
• 评论：7条
文章分类
最新评论