forked from mehul-1607/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path_1360.java
37 lines (35 loc) · 1.28 KB
/
_1360.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
package com.fishercoder.solutions;
/**
* 1360. Number of Days Between Two Dates
*
* Write a program to count the number of days between two dates.
* The two dates are given as strings, their format is YYYY-MM-DD as shown in the examples.
*
* Example 1:
* Input: date1 = "2019-06-29", date2 = "2019-06-30"
* Output: 1
*
* Example 2:
* Input: date1 = "2020-01-15", date2 = "2019-12-31"
* Output: 15
*
* Constraints:
* The given dates are valid dates between the years 1971 and 2100.
* */
public class _1360 {
public static class Solution1 {
public int daysBetweenDates(String date1, String date2) {
String[] strings1 = date1.split("-");
String[] strings2 = date2.split("-");
return Math.abs(julianDay(Integer.parseInt(strings1[0]), Integer.parseInt(strings1[1]), Integer.parseInt(strings1[2]))
- julianDay(Integer.parseInt(strings2[0]), Integer.parseInt(strings2[1]), Integer.parseInt(strings2[2])));
}
public int julianDay(int year, int month, int day) {
int a = (14 - month) / 12;
int y = year + 4800 - a;
int m = month + 12 * a - 3;
int jdn = day + (153 * m + 2) / 5 + 365 * y + y / 4 - y / 100 + y / 400 - 32045;
return jdn;
}
}
}