[프로그래머스] 튜플 (문자열, 정렬, python, javascript)

728x90
반응형

1. python 풀이

def solution(s):
    answer = []
    temp=[]

    for i in s[2:-2].split('},{'):
        temp.append(i.split(','))
    
    temp.sort(key=len)
    for t in temp:
        for item in t:
            if int(item) not in answer:
                answer.append(int(item))
    return answer

2. javascript 풀이

function solution(s) {
    var answer = [];
    s=s.split("").map(ch=>{
        if(ch==="{" || ch==="}"){
            return "";
        }
        return ch;
    }).join("").split(",");
    
    const dict={};
    for(let i=0;i<s.length;i++){
        if(dict[s[i]]===undefined){
            dict[s[i]]=1;
        }else{
            dict[s[i]]+=1;
        }
    }
    return Object.entries(dict).sort((a,b)=>b[1]-a[1])
    .reduce((acc,cur)=>{
        acc.push(+cur[0]);
        return acc;
    },[]);
}
728x90
반응형
TAGS.

Comments