add 1154

fishercoder1534 · fishercoder1534 · commit 4a14e9f1ce33 · 2019-08-16T12:40:08.000-07:00
diff --git a/README.md b/README.md
@@ -29,6 +29,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
 |5087|[Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_5087.java) | O(1) | O(1) | |Medium||
 |5083|[Occurrences After Bigram](https://leetcode.com/problems/occurrences-after-bigram/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_5083.java) | O(n) | O(1) | |Easy||
+|1154|[Day of the Year](https://leetcode.com/problems/day-of-the-year/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1154.java) | O(1) | O(1) | |Easy||
 |1137|[N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1137.java) | O(n) | O(n) | |Easy||
 |1122|[Relative Sort Array](https://leetcode.com/problems/relative-sort-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1122.java) | O(n) | O(n) | |Easy||
 |1089|[Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1089.java) | O(n^2) | O(1) | |Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1154.java b/src/main/java/com/fishercoder/solutions/_1154.java
@@ -0,0 +1,80 @@
+package com.fishercoder.solutions;
+
+import java.util.Calendar;
+
+/**
+ * 1154. Day of the Year
+ *
+ * Given a string date representing a Gregorian calendar date formatted as YYYY-MM-DD, return the day number of the year.
+ *
+ * Example 1:
+ *
+ * Input: date = "2019-01-09"
+ * Output: 9
+ * Explanation: Given date is the 9th day of the year in 2019.
+ * Example 2:
+ *
+ * Input: date = "2019-02-10"
+ * Output: 41
+ * Example 3:
+ *
+ * Input: date = "2003-03-01"
+ * Output: 60
+ * Example 4:
+ *
+ * Input: date = "2004-03-01"
+ * Output: 61
+ *
+ *
+ * Constraints:
+ *
+ * date.length == 10
+ * date[4] == date[7] == '-', and all other date[i]'s are digits
+ * date represents a calendar date between Jan 1st, 1900 and Dec 31, 2019.
+ * */
+public class _1154 {
+    public static class Solution1 {
+        Calendar cal = Calendar.getInstance();
+
+        public int dayOfYear(String date) {
+            int year = Integer.parseInt(date.substring(0, 4));
+            int month = Integer.parseInt(date.substring(5, 7));
+            int day = Integer.parseInt(date.substring(8, 10));
+            int thirtyDays = 30;
+            int thirtyOneDays = 31;
+            if (month == 1) {
+                return day;
+            } else if (month == 2) {
+                return day + thirtyOneDays;
+            } else {
+                int daysInFeb = isLeapYear(year) ? 29 : 28;
+                if (month == 3) {
+                    return thirtyOneDays + daysInFeb + day;
+                } else if (month == 4) {
+                    return 2 * thirtyOneDays + daysInFeb + day;
+                } else if (month == 5) {
+                    return 2 * thirtyOneDays + daysInFeb + day + thirtyDays;
+                } else if (month == 6) {
+                    return 3 * thirtyOneDays + daysInFeb + day + thirtyDays;
+                } else if (month == 7) {
+                    return 3 * thirtyOneDays + daysInFeb + day + 2 * thirtyDays;
+                } else if (month == 8) {
+                    return 4 * thirtyOneDays + daysInFeb + day + 2 * thirtyDays;
+                } else if (month == 9) {
+                    return 5 * thirtyOneDays + daysInFeb + day + 2 * thirtyDays;
+                } else if (month == 10) {
+                    return 5 * thirtyOneDays + daysInFeb + day + 3 * thirtyDays;
+                } else if (month == 11) {
+                    return 6 * thirtyOneDays + daysInFeb + day + 3 * thirtyDays;
+                } else {
+                    return 6 * thirtyOneDays + daysInFeb + day + 4 * thirtyDays;
+                }
+            }
+        }
+
+        private boolean isLeapYear(int year) {
+            cal.set(Calendar.YEAR, year);
+            return cal.getActualMaximum(Calendar.DAY_OF_YEAR) > 365;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1154Test.java b/src/test/java/com/fishercoder/_1154Test.java
@@ -0,0 +1,27 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1154;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1154Test {
+    private static _1154.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1154.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(9, solution1.dayOfYear("2019-01-09"));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(271, solution1.dayOfYear("1969-09-28"));
+    }
+
+}
