+ problem 335

Author: fruit-in

Problemset/0335-Self Crossing/README.md

@@ -0,0 +1,70 @@
+# 335. Self Crossing
+You are given an array of integers `distance`.
+
+You start at the point `(0, 0)` on an **X-Y plane**, and you move `distance[0]` meters to the north, then `distance[1]` meters to the west, `distance[2]` meters to the south, `distance[3]` meters to the east, and so on. In other words, after each move, your direction changes counter-clockwise.
+
+Return `true` *if your path crosses itself or* `false` *if it does not*.
+
+#### Example 1:
+![](https://assets.leetcode.com/uploads/2022/12/21/11.jpg)
+<pre>
+<strong>Input:</strong> distance = [2,1,1,2]
+<strong>Output:</strong> true
+<strong>Explanation:</strong> The path crosses itself at the point (0, 1).
+</pre>
+
+#### Example 2:
+![](https://assets.leetcode.com/uploads/2022/12/21/22.jpg)
+<pre>
+<strong>Input:</strong> distance = [1,2,3,4]
+<strong>Output:</strong> false
+<strong>Explanation:</strong> The path does not cross itself at any point.
+</pre>
+
+#### Example 3:
+![](https://assets.leetcode.com/uploads/2022/12/21/33.jpg)
+<pre>
+<strong>Input:</strong> distance = [1,1,1,2,1]
+<strong>Output:</strong> true
+<strong>Explanation:</strong> The path crosses itself at the point (0, 0).
+</pre>
+
+#### Constraints:
+* <code>1 <= distance.length <= 10<sup>5</sup></code>
+* <code>1 <= distance[i] <= 10<sup>5</sup></code>
+
+## Solutions (Rust)
+
+### 1. Solution
+```Rust
+impl Solution {
+ pub fn is_self_crossing(mut distance: Vec<i32>) -> bool {
+ let mut i = 2;
+
+ while i < distance.len() {
+ if distance[i] <= distance[i - 2] {
+ let mut tmp = distance[i - 2];
+ if i > 3 {
+ tmp -= distance[i - 4];
+ }
+ if i > 2 && distance[i] >= tmp {
+ distance[i - 1] -= distance[i - 3];
+ }
+ break;
+ }
+
+ i += 1;
+ }
+
+ while i < distance.len() - 1 {
+ i += 1;
+
+ if distance[i] >= distance[i - 2] {
+ return true;
+ }
+ }
+
+ false
+ }
+}
+```

Problemset/0335-Self Crossing/README_CN.md

@@ -0,0 +1,67 @@
+# 335. 路径交叉
+给你一个整数数组 `distance` 。
+
+从 **X-Y** 平面上的点 `(0,0)` 开始，先向北移动 `distance[0]` 米，然后向西移动 `distance[1]` 米，向南移动 `distance[2]` 米，向东移动 `distance[3]` 米，持续移动。也就是说，每次移动后你的方位会发生逆时针变化。
+
+判断你所经过的路径是否相交。如果相交，返回 `true` ；否则，返回 `false` 。
+
+#### 示例 1:
+![](https://assets.leetcode.com/uploads/2021/03/14/selfcross1-plane.jpg)
+<pre>
+<strong>输入:</strong> distance = [2,1,1,2]
+<strong>输出:</strong> true
+</pre>
+
+#### 示例 2:
+![](https://assets.leetcode.com/uploads/2021/03/14/selfcross2-plane.jpg)
+<pre>
+<strong>输入:</strong> distance = [1,2,3,4]
+<strong>输出:</strong> false
+</pre>
+
+#### 示例 3:
+![](https://assets.leetcode.com/uploads/2021/03/14/selfcross3-plane.jpg)
+<pre>
+<strong>输入:</strong> distance = [1,1,1,1]
+<strong>输出:</strong> true
+</pre>
+
+#### 提示:
+* <code>1 <= distance.length <= 10<sup>5</sup></code>
+* <code>1 <= distance[i] <= 10<sup>5</sup></code>
+
+## 题解 (Rust)
+
+### 1. 题解
+```Rust
+impl Solution {
+ pub fn is_self_crossing(mut distance: Vec<i32>) -> bool {
+ let mut i = 2;
+
+ while i < distance.len() {
+ if distance[i] <= distance[i - 2] {
+ let mut tmp = distance[i - 2];
+ if i > 3 {
+ tmp -= distance[i - 4];
+ }
+ if i > 2 && distance[i] >= tmp {
+ distance[i - 1] -= distance[i - 3];
+ }
+ break;
+ }
+
+ i += 1;
+ }
+
+ while i < distance.len() - 1 {
+ i += 1;
+
+ if distance[i] >= distance[i - 2] {
+ return true;
+ }
+ }
+
+ false
+ }
+}
+```

Problemset/0335-Self Crossing/Solution.rs

@@ -0,0 +1,30 @@
+impl Solution {
+ pub fn is_self_crossing(mut distance: Vec<i32>) -> bool {
+ let mut i = 2;
+
+ while i < distance.len() {
+ if distance[i] <= distance[i - 2] {
+ let mut tmp = distance[i - 2];
+ if i > 3 {
+ tmp -= distance[i - 4];
+ }
+ if i > 2 && distance[i] >= tmp {
+ distance[i - 1] -= distance[i - 3];
+ }
+ break;
+ }
+
+ i += 1;
+ }
+
+ while i < distance.len() - 1 {
+ i += 1;
+
+ if distance[i] >= distance[i - 2] {
+ return true;
+ }
+ }
+
+ false
+ }
+}

README.md

@@ -259,6 +259,7 @@
 [331][331l] |[Verify Preorder Serialization of a Binary Tree][331] |![rs]
 [332][332l] |[Reconstruct Itinerary][332] |![py]
 [334][334l] |[Increasing Triplet Subsequence][334] |![rb]  ![rs]
+[335][335l] |[Self Crossing][335] |![rs]
 [337][337l] |[House Robber III][337] |![py]  ![rb]
 [338][338l] |[Counting Bits][338] |![rs]
 [341][341l] |[Flatten Nested List Iterator][341] |![rs]
@@ -2181,6 +2182,7 @@
 [331]:Problemset/0331-Verify%20Preorder%20Serialization%20of%20a%20Binary%20Tree/README.md#331-verify-preorder-serialization-of-a-binary-tree
 [332]:Problemset/0332-Reconstruct%20Itinerary/README.md#332-reconstruct-itinerary
 [334]:Problemset/0334-Increasing%20Triplet%20Subsequence/README.md#334-increasing-triplet-subsequence
+[335]:Problemset/0335-Self%20Crossing/README.md#335-self-crossing
 [337]:Problemset/0337-House%20Robber%20III/README.md#337-house-robber-iii
 [338]:Problemset/0338-Counting%20Bits/README.md#338-counting-bits
 [341]:Problemset/0341-Flatten%20Nested%20List%20Iterator/README.md#341-flatten-nested-list-iterator
@@ -4096,6 +4098,7 @@
 [331l]:https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/
 [332l]:https://leetcode.com/problems/reconstruct-itinerary/
 [334l]:https://leetcode.com/problems/increasing-triplet-subsequence/
+[335l]:https://leetcode.com/problems/self-crossing/
 [337l]:https://leetcode.com/problems/house-robber-iii/
 [338l]:https://leetcode.com/problems/counting-bits/
 [341l]:https://leetcode.com/problems/flatten-nested-list-iterator/

README_CN.md

@@ -259,6 +259,7 @@
 [331][331l] |[验证二叉树的前序序列化][331] |![rs]
 [332][332l] |[重新安排行程][332] |![py]
 [334][334l] |[递增的三元子序列][334] |![rb]  ![rs]
+[335][335l] |[路径交叉][335] |![rs]
 [337][337l] |[打家劫舍 III][337] |![py]  ![rb]
 [338][338l] |[比特位计数][338] |![rs]
 [341][341l] |[扁平化嵌套列表迭代器][341] |![rs]
@@ -2181,6 +2182,7 @@
 [331]:Problemset/0331-Verify%20Preorder%20Serialization%20of%20a%20Binary%20Tree/README_CN.md#331-验证二叉树的前序序列化
 [332]:Problemset/0332-Reconstruct%20Itinerary/README_CN.md#332-重新安排行程
 [334]:Problemset/0334-Increasing%20Triplet%20Subsequence/README_CN.md#334-递增的三元子序列
+[335]:Problemset/0335-Self%20Crossing/README_CN.md#335-路径交叉
 [337]:Problemset/0337-House%20Robber%20III/README_CN.md#337-打家劫舍-iii
 [338]:Problemset/0338-Counting%20Bits/README_CN.md#338-比特位计数
 [341]:Problemset/0341-Flatten%20Nested%20List%20Iterator/README_CN.md#341-扁平化嵌套列表迭代器
@@ -4096,6 +4098,7 @@
 [331l]:https://leetcode.cn/problems/verify-preorder-serialization-of-a-binary-tree/
 [332l]:https://leetcode.cn/problems/reconstruct-itinerary/
 [334l]:https://leetcode.cn/problems/increasing-triplet-subsequence/
+[335l]:https://leetcode.cn/problems/self-crossing/
 [337l]:https://leetcode.cn/problems/house-robber-iii/
 [338l]:https://leetcode.cn/problems/counting-bits/
 [341l]:https://leetcode.cn/problems/flatten-nested-list-iterator/