You are given two arrays of strings that represent two inClusive events that happened on the SAme day, event1 and event2, where:
event1 = [startTime1, endTime1] and
event2 = [startTime2, endTime2].
Event times are valid 24 hours format in the form of HH:MM.
A conflict happens when two events have some non-empty intersection (i.e., some moment is common to both events).
Return true if there is a conflict between two events. Otherwise, return false.
Example 1:
Input: event1 = [“01:15”,“02:00”], event2 = [“02:00”,“03:00”]
Output: true
Explanation: The two events intersect at time 2:00.
Example 2:
Input: event1 = [“01:00”,“02:00”], event2 = [“01:20”,“03:00”]
Output: true
Explanation: The two events intersect starting from 01:20 to 02:00.
Example 3:
Input: event1 = [“10:00”,“11:00”], event2 = [“14:00”,“15:00”]
Output: false
Explanation: The two events do not intersect.
constraints:
evnet1.length == event2.length == 2.
event1[i].length == event2[i].length == 5
startTime1 return true; } return true; } public: bool haveConflict(vector if (event1[0] return true; } if (event2[0] return true; } return false; } }; public: bool haveConflict(vector int time1begin = convertTime(event1[0]); int time1end = convertTime(event1[1]); int time2begin = convertTime(event2[0]); int time2end = convertTime(event2[1]); int mintime = min(time1begin , time2begin); int maxtime = max(time1end,time2end); int x = maxtime - mintime; int intersect = x -(time1end - time1begin) -(time2end-time2begin ); return intersect int result=0; result += std::stoi(time.substr(0,2))*60; // result += std::stoi(time.substr(3,2)); return result; } };
