[알고리즘문제풀기] 날짜 비교하기

문제

내가 작성한 정답

cclass Solution {
    public int solution(int[] date1, int[] date2) {
        int answer = 0;
        for(int i=0; i<3; i++){
            if(date1[i]<date2[i]) return 1;
            else if(date1[i]>date2[i]) return 0;
        }
        return 0;
    }
}

다른 사람들의 정답

import java.time.LocalDate;

class Solution {

    public int solution(int[] date1, int[] date2) {

        LocalDate dateA = LocalDate.of(date1[0], date1[1], date1[2]);
        LocalDate dateB = LocalDate.of(date2[0], date2[1], date2[2]);
				// isBefore(), isAfter(), isEqual() 
        if (dateA.isBefore(dateB)) {
            return 1;
        } else {
            return 0;
        }
    }
}


import java.util.*;

class Solution {
    public int solution(int[] date1, int[] date2) {
        return Arrays.compare(date1, date2) < 0 ? 1 : 0;
    }
}

class Solution {
    public int solution(int[] date1, int[] date2) {
        int date1Days = getTotalDays(date1);
        int date2Days = getTotalDays(date2);
        return date1Days < date2Days ? 1 : 0;
    }

    public int getTotalDays(int[] date) {
        int result = 0;
        result += date[0] * 360;
        result += date[1] * 30;
        result += date[2];
        return result;
    }
}