MapleStory Finger Point Cute Line Smiley Blinking Hello Kitty Angel MapleStory Finger Point

๐Ÿƒ‍โ™€๏ธprogrammers/Java

หšโ‚Šโœฉโ€งโ‚Š ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค - java ๋‚ ์งœ ๋น„๊ตํ•˜๊ธฐ หšโ‚Šโœฉโ€งโ‚Š

HYEJU01 2024. 5. 10. 15:58

 ๐Ÿ’ก ๋‚ ์งœ ๋‘๊ฐœ ์ค‘ ์•ž์„œ๋Š” ๋‚ ์งœ๋ฅผ ๊ณ ๋ฅด๋Š” ์ฝ”๋“œ์ด๋‹ค.

์ฆ‰ data1 ์ด ๋” ๋Š๋ฆฐ ๋‚ ์งœ๋ฉด 1์„ ์ถœ๋ ฅํ•œ๋‹ค.

 

 

1) Y1 < Y2  -> ๋ฌด์กฐ๊ฑด ๋” ๋Š๋ฆผ//   ๊ฒฐ๊ณผ๊ฐ’ 1

2) M1 < M2 -> ๋” ๋Š๋ฆผ 

3) D1 < D2  -> ๋” ๋Š๋ฆผ

 

์ด๋•Œ ๋ฐ˜๋ก€๋ฅผ ์ฃผ์˜ํ•ด์•ผํ•œ๋‹ค. 

๋’ท๊ฐ’์ด ์ž‘์€๊ฒฝ์šฐ ๊ทธ ๊ฐ’์„ ๊ฒฐ๊ณผ๊ฐ’์œผ๋กœ ์ถœ๋ ฅํ•˜๊ฒŒ ๋œ๋‹ค !!

 

------------------------

[10000, 12, 15] <=>  [0, 12, 17]

 

1) Y1 > Y2  -> ๋” ํฌ๋ฏ€๋กœ ๋น ๋ฆ„// ํŒจ์Šค

2) M1 == M2 -> ๊ฐ™์Œ // ํŒจ์Šค

3) D1 < D2  ->  ์ž‘์Œ  // ๊ฒฐ๊ณผ๊ฐ’ 1

------------------------

 

๋งˆ์ง€๋ง‰ ์กฐ๊ฑด์„ ๋ณด๊ณ  ์ง€๋ฉ‹๋Œ€๋กœ (?) ๊ฒฐ๊ณผ๊ฐ€ ๋‚˜์™€๋ฒ„๋ฆฌ๊ธฐ ๋•Œ๋ฌธ์—

2,3๋ฒˆ์— ๊ฐ™๋‹ค ์กฐ๊ฑด์„ ๋„ฃ์–ด์ฃผ๋ฉด์„œ ํ’€์–ด์•ผํ•œ๋‹ค.

๊ฐ™๋‹ค ์กฐ๊ฑด์„ ๋„ฃ์–ด์ฃผ๊ฒŒ๋˜๋ฉด ๋งˆ์ง€๋ง‰ ์กฐ๊ฑด์ด ๋ฉ‹๋Œ€๋กœ ์ถœ๋ ฅ๋˜์ง€์•Š๋Š”๋‹ค.

 

1) Y1 < Y2  

2) Y1 == Y2  && M1 < M2 

3)  Y1 == Y2  && M1 == M2  && D1 < D2  

 

class Solution {
    public int solution(int[] date1, int[] date2) {
        int answer = 0;
        
            if (date1[0] < date2[0])
                answer = 1;
            
            if (date1[0] == date2[0] && date1[1] < date2[1])
                answer = 1;
                
            if(date1[0] == date2[0] && date1[1] ==
               date2[1] && date1[2] < date2[2])
                answer = 1; 
                 
        
        return answer;
    }
}

 

 

 

 

[์‹คํŒจ] 

ํ…Œ์ŠคํŠธ 1238 ์ด ์‹คํŒจํ•œ๋‹ค. ใ… ใ… 

class Solution {
    public int solution(int[] date1, int[] date2) {
        int answer = 0;
        
            if (date1[0] < date2[0] )
                answer = 1;
            
            if (date1[1] < date2[1])
                answer = 1;
                
            if(date1[2] < date2[2])
                answer = 1; 
                 
        
        return answer;
    }
}

 

class Solution {
    public int solution(int[] date1, int[] date2) {
        int answer = 0;
        
        //data1 data2 ??  ๋…„๋„ ์›” ์ผ ์ˆœ์œผ๋กœ ๋น„๊ต
        for (int i = 0 ; i< date1.length; i++){
            if (date1[i] < date2[i]){
                answer = 1; break;
            }
        }

        return answer;
    }
}