Add: algorithm of programmers

Author: ImSejin

src/main/java/io/github/imsejin/study/programmers/L150370.java

@@ -31,7 +31,7 @@ static int[] solve0(String today, String[] terms, String[] privacies) {
             Integer month = termMap.get(type);
             LocalDate deleteDate = joinDate.plusMonths(month);
 
-            if (deleteDate.compareTo(todayDate) <= 0) {
+            if (!deleteDate.isAfter(todayDate)) {
                 privaciesToDelete.add(i + 1);
             }
         }
@@ -112,6 +112,7 @@ public DateString plusMonth(int monthToAdd) {
             int year = this.year;
             if (this.month + monthToAdd > 12) {
                 year += (this.month + monthToAdd) / 12;
+                if (month == 12) year--;
             }
 
             return new DateString(year, month, this.day);
@@ -124,7 +125,13 @@ public String toString() {
 
         @Override
         public int compareTo(DateString o) {
-            return this.toString().compareTo(o.toString());
+            int comparison = Integer.compare(this.year, o.year);
+            if (comparison != 0) return comparison;
+
+            comparison = Integer.compare(this.month, o.month);
+            if (comparison != 0) return comparison;
+
+            return Integer.compare(this.day, o.day);
         }
     }
 

src/test/groovy/io/github/imsejin/study/programmers/L150370Spec.groovy

@@ -10,6 +10,7 @@ class L150370Spec extends Specification {
 
         then:
         actual == expected as int[]
+        actual == L150370.solve1(today, terms as String[], privacies as String[])
 
         where:
         today        | terms                  | privacies                                                                        || expected