Deep_Dev
article thumbnail

๋ฌธ์ œ ์„ค๋ช…

์„ ๋ถ„ ์„ธ ๊ฐœ๋กœ ์‚ผ๊ฐํ˜•์„ ๋งŒ๋“ค๊ธฐ ์œ„ํ•ด์„œ๋Š” ๋‹ค์Œ๊ณผ ๊ฐ™์€ ์กฐ๊ฑด์„ ๋งŒ์กฑํ•ด์•ผ ํ•ฉ๋‹ˆ๋‹ค.

  • ๊ฐ€์žฅ ๊ธด ๋ณ€์˜ ๊ธธ์ด๋Š” ๋‹ค๋ฅธ ๋‘ ๋ณ€์˜ ๊ธธ์ด์˜ ํ•ฉ๋ณด๋‹ค ์ž‘์•„์•ผ ํ•ฉ๋‹ˆ๋‹ค.

์‚ผ๊ฐํ˜•์˜ ๋‘ ๋ณ€์˜ ๊ธธ์ด๊ฐ€ ๋‹ด๊ธด ๋ฐฐ์—ด sides์ด ๋งค๊ฐœ๋ณ€์ˆ˜๋กœ ์ฃผ์–ด์ง‘๋‹ˆ๋‹ค. ๋‚˜๋จธ์ง€ ํ•œ ๋ณ€์ด ๋  ์ˆ˜ ์žˆ๋Š” ์ •์ˆ˜์˜ ๊ฐœ์ˆ˜๋ฅผ returnํ•˜๋„๋ก solution ํ•จ์ˆ˜๋ฅผ ์™„์„ฑํ•ด์ฃผ์„ธ์š”.

 
 
 
์ œํ•œ์‚ฌํ•ญ
  • sides์˜ ์›์†Œ๋Š” ์ž์—ฐ์ˆ˜์ž…๋‹ˆ๋‹ค.
  • sides์˜ ๊ธธ์ด๋Š” 2์ž…๋‹ˆ๋‹ค.
  • 1 ≤ sides์˜ ์›์†Œ ≤ 1,000

 

 

์ž…์ถœ๋ ฅ ์˜ˆsidesresult
[1, 2] 1
[3, 6] 5
[11, 7] 13

 

 

 

 


 

 

 

 

import java.util.Arrays;
class Solution {
    public int solution(int[] sides) {
        int answer=0;
        Arrays.sort(sides); // ์ •๋ ฌ
        //๊ฐ€์žฅ ๊ธด๋ณ€์ด ์ด๋ฏธ ๋‚˜์™€์žˆ๋Š” ๊ฒฝ์šฐ
        for(int i=0; i<=sides[1]; i++){
            if(i+sides[0]>sides[1])
                answer++;
        }
        //๋‚˜๋จธ์ง€ ํ•œ๋ณ€์ด ๊ฐ€์žฅ ๊ธด ๊ฒฝ์šฐ
        for(int i=sides[1]+1; i<sides[0]+sides[1]; i++) answer++;
        return answer;
    }
}