LV. 0 :: 삼각형의 완성조건

https://school.programmers.co.kr/learn/courses/30/lessons/120889

프로그래머스

 

function solution(sides) {
    var answer = 0;
    let longside = 0;
    let sum = sides[0]+sides[1]+sides[2];
    
    for (i=0; i<3; i++)
    {
        if (longside < sides[i])
        {
            longside=sides[i];
        }
    }
    
    if (sum-longside > longside){answer = 1;}
    else {answer=2;}
    return answer;
}

+)230510

const solution = (sides) => {
    let answer = 0;
    sides = sides.sort((a,b)=>a-b);
    (sides[0]+sides[1]>sides[2] ? answer = 1 : answer = 2);
    return answer;
}

230525 python

def solution(sides): 
    answer = 2
    sides.sort();
    if sides[0]+sides[1]>sides[2]:
        answer = 1
    return answer

230915 C++

#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int solution(vector<int> sides) {
    int answer = 0;
    int max = *std::max_element(sides.begin(), sides.end());
    int sum = 0;
    for(int i=0; i<sides.size(); i++) {
        sum += sides[i];  
    }
    (sum-max>max) ? answer=1 : answer =2;
    return answer;
}

-

#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int solution(vector<int> sides) {
int answer = 0;
    sort(sides.begin(), sides.end());
    (sides[0]+sides[1]>sides[2]) ? answer = 1 : answer = 2;
    return answer;
}