feat: add solutions to lc problem: No.2446

No.2446.Determine if Two Events Have Conflict

Author: yanglbme

solution/2400-2499/2446.Determine if Two Events Have Conflict/README.md

@@ -63,7 +63,9 @@
 
 **方法一：字符串比较**
 
-事件 1 的开始时间小于等于事件 2 的结束时间，且事件 1 的结束时间大于等于事件 2 的开始时间，即可判断出事件 1 和事件 2 存在交集。
+如果 $event1$ 的开始时间大于 $event2$ 的结束时间，或者 $event1$ 的结束时间小于 $event2$ 的开始时间，那么两个事件不会有冲突。否则，两个事件存在冲突。
+
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2400-2499/2446.Determine%20if%20Two%20Events%20Have%20Conflict/images/event.png" />
 
 时间复杂度 $O(1)$，空间复杂度 $O(1)$。
 
@@ -76,7 +78,7 @@
 ```python
 class Solution:
     def haveConflict(self, event1: List[str], event2: List[str]) -> bool:
-        return event1[0] <= event2[1] and event1[1] >= event2[0]
+        return not (event1[0] > event2[1] or event1[1] < event2[0])
 ```
 
 ### **Java**
@@ -86,7 +88,7 @@ class Solution:
 ```java
 class Solution {
     public boolean haveConflict(String[] event1, String[] event2) {
-        return event1[0].compareTo(event2[1]) <= 0 && event1[1].compareTo(event2[0]) >= 0;
+        return !(event1[0].compareTo(event2[1]) > 0 || event1[1].compareTo(event2[0]) < 0);
     }
 }
 ```
@@ -97,7 +99,7 @@ class Solution {
 class Solution {
 public:
     bool haveConflict(vector<string>& event1, vector<string>& event2) {
-        return event1[0] <= event2[1] && event1[1] >= event2[0];
+        return !(event1[0] > event2[1] || event1[1] < event2[0]);
     }
 };
 ```
@@ -106,15 +108,15 @@ public:
 
 ```go
 func haveConflict(event1 []string, event2 []string) bool {
-    return event1[0] <= event2[1] && event1[1] >= event2[0]
+	return !(event1[0] > event2[1] || event1[1] < event2[0])
 }
 ```
 
 ### **TypeScript**
 
 ```ts
 function haveConflict(event1: string[], event2: string[]): boolean {
-    return event1[0] <= event2[1] && event1[1] >= event2[0];
+    return !(event1[0] > event2[1] || event1[1] < event2[0]);
 }
 ```
 

solution/2400-2499/2446.Determine if Two Events Have Conflict/README_EN.md

@@ -62,15 +62,15 @@
 ```python
 class Solution:
     def haveConflict(self, event1: List[str], event2: List[str]) -> bool:
-        return event1[0] <= event2[1] and event1[1] >= event2[0]
+        return not (event1[0] > event2[1] or event1[1] < event2[0])
 ```
 
 ### **Java**
 
 ```java
 class Solution {
     public boolean haveConflict(String[] event1, String[] event2) {
-        return event1[0].compareTo(event2[1]) <= 0 && event1[1].compareTo(event2[0]) >= 0;
+        return !(event1[0].compareTo(event2[1]) > 0 || event1[1].compareTo(event2[0]) < 0);
     }
 }
 ```
@@ -81,7 +81,7 @@ class Solution {
 class Solution {
 public:
     bool haveConflict(vector<string>& event1, vector<string>& event2) {
-        return event1[0] <= event2[1] && event1[1] >= event2[0];
+        return !(event1[0] > event2[1] || event1[1] < event2[0]);
     }
 };
 ```
@@ -90,15 +90,15 @@ public:
 
 ```go
 func haveConflict(event1 []string, event2 []string) bool {
-    return event1[0] <= event2[1] && event1[1] >= event2[0]
+	return !(event1[0] > event2[1] || event1[1] < event2[0])
 }
 ```
 
 ### **TypeScript**
 
 ```ts
 function haveConflict(event1: string[], event2: string[]): boolean {
-    return event1[0] <= event2[1] && event1[1] >= event2[0];
+    return !(event1[0] > event2[1] || event1[1] < event2[0]);
 }
 ```
 

solution/2400-2499/2446.Determine if Two Events Have Conflict/Solution.cpp

@@ -1,6 +1,6 @@
 class Solution {
 public:
     bool haveConflict(vector<string>& event1, vector<string>& event2) {
-        return event1[0] <= event2[1] && event1[1] >= event2[0];
+        return !(event1[0] > event2[1] || event1[1] < event2[0]);
     }
 };

solution/2400-2499/2446.Determine if Two Events Have Conflict/Solution.go

@@ -1,3 +1,3 @@
 func haveConflict(event1 []string, event2 []string) bool {
-	return event1[0] <= event2[1] && event1[1] >= event2[0]
+	return !(event1[0] > event2[1] || event1[1] < event2[0])
 }

solution/2400-2499/2446.Determine if Two Events Have Conflict/Solution.java

@@ -1,5 +1,5 @@
 class Solution {
     public boolean haveConflict(String[] event1, String[] event2) {
-        return event1[0].compareTo(event2[1]) <= 0 && event1[1].compareTo(event2[0]) >= 0;
+        return !(event1[0].compareTo(event2[1]) > 0 || event1[1].compareTo(event2[0]) < 0);
     }
 }

solution/2400-2499/2446.Determine if Two Events Have Conflict/Solution.py

@@ -1,3 +1,3 @@
 class Solution:
     def haveConflict(self, event1: List[str], event2: List[str]) -> bool:
-        return event1[0] <= event2[1] and event1[1] >= event2[0]
+        return not (event1[0] > event2[1] or event1[1] < event2[0])

solution/2400-2499/2446.Determine if Two Events Have Conflict/Solution.ts

@@ -1,3 +1,3 @@
 function haveConflict(event1: string[], event2: string[]): boolean {
-    return event1[0] <= event2[1] && event1[1] >= event2[0];
+    return !(event1[0] > event2[1] || event1[1] < event2[0]);
 }