add 1360

fishercoder1534 · fishercoder1534 · commit 36dfb13f7cc1 · 2020-02-23T04:31:19.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1360|[Number of Days Between Two Dates](https://leetcode.com/problems/number-of-days-between-two-dates/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1360.java) | |Easy||
 |1358|[Number of Substrings Containing All Three Characters](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1358.java) | |Medium|String|
 |1357|[Apply Discount Every n Orders](https://leetcode.com/problems/apply-discount-every-n-orders/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1357.java) | |Medium|Design|
 |1356|[Sort Integers by The Number of 1 Bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1356.java) | |Easy|Sort, Bit Manipulation|
diff --git a/src/main/java/com/fishercoder/solutions/_1360.java b/src/main/java/com/fishercoder/solutions/_1360.java
@@ -0,0 +1,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;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1360Test.java b/src/test/java/com/fishercoder/_1360Test.java
@@ -0,0 +1,27 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1360;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1360Test {
+    private static _1360.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1360.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(1, solution1.daysBetweenDates("2019-06-29", "2019-06-30"));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(15, solution1.daysBetweenDates("2020-01-15", "2019-12-31"));
+    }
+
+}
