Problem
Alice and Bob are traveling to Rome for separate business meetings.
You are given 4 strings arriveAlice, leaveAlice, arriveBob, and leaveBob. Alice will be in the city from the dates arriveAlice to leaveAlice (inclusive), while Bob will be in the city from the dates arriveBob to leaveBob (inclusive). Each will be a 5-character string in the format "MM-DD", corresponding to the month and day of the date.
Return** the total number of days that Alice and Bob are in Rome together.**
You can assume that all dates occur in the same calendar year, which is not a leap year. Note that the number of days per month can be represented as: [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31].
Example 1:
Input: arriveAlice = "08-15", leaveAlice = "08-18", arriveBob = "08-16", leaveBob = "08-19"
Output: 3
Explanation: Alice will be in Rome from August 15 to August 18. Bob will be in Rome from August 16 to August 19. They are both in Rome together on August 16th, 17th, and 18th, so the answer is 3.
Example 2:
Input: arriveAlice = "10-01", leaveAlice = "10-31", arriveBob = "11-01", leaveBob = "12-31"
Output: 0
Explanation: There is no day when Alice and Bob are in Rome together, so we return 0.
Constraints:
All dates are provided in the format
"MM-DD".Alice and Bob's arrival dates are earlier than or equal to their leaving dates.
The given dates are valid dates of a non-leap year.
Solution (Java)
class Solution {
int[] months = new int[]{31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
public int countDaysTogether(String s1, String e1, String s2, String e2) {
int[] a = new int[]{ getVal(s1), getVal(e1) };
int[] b = new int[]{ getVal(s2), getVal(e2) };
if(b[0]>a[1] || a[0]>b[1]) return 0; // no overlap
int start = Math.max(a[0], b[0]);
int last = Math.min(a[1], b[1]);
return last-start+1;
}
// convert date to nth day of year, (1st-365th day)
int getVal(String str){
int idx = 0;
int mon = (str.charAt(0)-'0')*10+(str.charAt(1)-'0');
int day = (str.charAt(3)-'0')*10+(str.charAt(4)-'0');
for(int i=1; i<mon; i++) idx += months[i-1]; // or use prefix sum
return idx+day;
}
}
Explain:
nope.
Complexity:
- Time complexity : O(n).
- Space complexity : O(n).