add 1118

fishercoder1534 · fishercoder1534 · commit a75dee86e352 · 2020-02-02T15:03:41.000-08:00
diff --git a/README.md b/README.md
@@ -62,6 +62,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1122|[Relative Sort Array](https://leetcode.com/problems/relative-sort-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1122.java) | |Easy||
 |1170|[Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1170.java) | |Easy||
 |1119|[Remove Vowels from a String](https://leetcode.com/problems/remove-vowels-from-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1119.java) |  [:tv:](https://www.youtube.com/watch?v=6KCBrIWEauw)|Easy||
+|1118|[Number of Days in a Month](https://leetcode.com/problems/number-of-days-in-a-month/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1118.java) | |Easy||
 |1108|[Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1108.java) |  [:tv:](https://www.youtube.com/watch?v=FP0Na-pL0qk)|Easy||
 |1103|[Distribute Candies to People](https://leetcode.com/problems/distribute-candies-to-people/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1103.java) | |Easy|Math|
 |1099|[Two Sum Less Than K](https://leetcode.com/problems/two-sum-less-than-k/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1099.java) |  [:tv:](https://www.youtube.com/watch?v=2Uq7p7HE0TI)|Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1118.java b/src/main/java/com/fishercoder/solutions/_1118.java
@@ -0,0 +1,42 @@
+package com.fishercoder.solutions;
+
+import java.util.HashMap;
+import java.util.Map;
+
+/**
+ * 1118. Number of Days in a Month
+ *
+ * Given a year Y and a month M, return how many days there are in that month.
+ *
+ * Example 1:
+ * Input: Y = 1992, M = 7
+ * Output: 31
+ *
+ * Example 2:
+ * Input: Y = 2000, M = 2
+ * Output: 29
+ *
+ * Example 3:
+ * Input: Y = 1900, M = 2
+ * Output: 28
+ *
+ * Note:
+ * 1583 <= Y <= 2100
+ * 1 <= M <= 12
+ * */
+public class _1118 {
+    public static class Solution1 {
+        public int numberOfDays(int Y, int M) {
+            int[] map = new int[]{0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
+            if (isLeapYear(Y) && M == 2) {
+                return 29;
+            } else {
+                return map[M];
+            }
+        }
+
+        private boolean isLeapYear(int year) {
+            return year % 4 == 0 && ((year % 100 == 0 && year % 400 == 0) || year % 100 != 0);
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1118Test.java b/src/test/java/com/fishercoder/_1118Test.java
@@ -0,0 +1,37 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1118;
+import org.junit.Before;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1118Test {
+    private static _1118.Solution1 solution1;
+
+    @Before
+    public void setupForEachTest() {
+        solution1 = new _1118.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(31, solution1.numberOfDays(1992, 7));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(29, solution1.numberOfDays(2000, 2));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(28, solution1.numberOfDays(1900, 2));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(29, solution1.numberOfDays(1836, 2));
+    }
+
+}
