class Solution:
def countDaysTogether(self, arriveAlice: str, leaveAlice: str, arriveBob: str, leaveBob: str) -> int:
arr = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]
totalAlice = arriveAlice.split("-")
totalAliceLeave = leaveAlice.split("-")
am = int(totalAlice[0]) - 1
adstart = sum(arr[:am]) + int(totalAlice[1])
am = int(totalAliceLeave[0]) - 1
adend = sum(arr[:am]) + int(totalAliceLeave[1])
print(adstart, adend)
totalBob = arriveBob.split("-")
totalBobLeave = leaveBob.split("-")
bm = int(totalBob[0]) - 1
bdstart = sum(arr[:bm]) + int(totalBob[1])
bm = int(totalBobLeave[0]) - 1
bdend = sum(arr[:bm]) + int(totalBobLeave[1])
print(bdstart, bdend)
answer = min(bdend, adend) - max(adstart, bdstart)+1
if answer >0:
return answer
return 0
489A - SwapSort | 932A - Palindromic Supersequence |
433A - Kitahara Haruki's Gift | 672A - Summer Camp |
1277A - Happy Birthday Polycarp | 577A - Multiplication Table |
817C - Really Big Numbers | 1355A - Sequence with Digits |
977B - Two-gram | 993A - Two Squares |
1659D - Reverse Sort Sum | 1659A - Red Versus Blue |
1659B - Bit Flipping | 1480B - The Great Hero |
1519B - The Cake Is a Lie | 1659C - Line Empire |
515A - Drazil and Date | 1084B - Kvass and the Fair Nut |
1101A - Minimum Integer | 985D - Sand Fortress |
1279A - New Year Garland | 1279B - Verse For Santa |
202A - LLPS | 978A - Remove Duplicates |
1304A - Two Rabbits | 225A - Dice Tower |
1660D - Maximum Product Strikes Back | 1513A - Array and Peaks |
1251B - Binary Palindromes | 768B - Code For 1 |