C语言 | Leetcode C语言题解之第335题路径交叉

题目：

题解：

bool isSelfCrossing(int* distance, int distanceSize){if (distance == NULL || distanceSize < 4) {return false;}for (int  i = 3; i < distanceSize; i++) {if ((distance[i] >= distance[i - 2]) && (distance[i - 1] <= distance[i - 3])) {return true;}if (i > 3) {if ((distance[i - 4] + distance[i] >= distance[i - 2]) && (distance[i - 1] == distance[i - 3])) {return true;}}if (i >= 5) {if ((distance[i] + distance[i - 4] >= distance[i - 2]) && (distance[i - 1] + distance[i - 5] >= distance[i - 3]) && distance[i - 2] > distance[i - 4] && distance[i - 3] > distance[i - 1]) {return true;}}}return false;
}