Notice
Recent Posts
Recent Comments
Link
«   2024/07   »
1 2 3 4 5 6
7 8 9 10 11 12 13
14 15 16 17 18 19 20
21 22 23 24 25 26 27
28 29 30 31
Archives
Today
Total
관리 메뉴

KSI일기장

프로그래머스 외계행성의 나이(자바) 본문

JavaAlgorithm

프로그래머스 외계행성의 나이(자바)

MyDiaryYo 2023. 12. 7. 10:41

 

 

 

 

 

class Solution {
    public String solution(int age) {
        String answer = "";
         int ageDv1 = age/10;
        int ageDv2 = age%10;

         if(ageDv1<1) {			//age가 1의 자리 일때
            switch (age){
                case 0: answer += "a";   break;
                case 1: answer += "b";   break;
                case 2: answer += "c";   break;
                case 3: answer += "d";   break;
                case 4: answer += "e";   break;
                case 5: answer += "f";   break;
                case 6: answer += "g";   break;
                case 7: answer += "h";   break;
                case 8: answer += "i";   break;
                case 9: answer += "j";   break;
            }
        }else if(ageDv1<10) {		//age가 10의 자리 일때
            switch (ageDv1){
                case 0: answer += "a";   break;
                case 1: answer += "b";   break;
                case 2: answer += "c";   break;
                case 3: answer += "d";   break;
                case 4: answer += "e";   break;
                case 5: answer += "f";   break;
                case 6: answer += "g";   break;
                case 7: answer += "h";   break;
                case 8: answer += "i";   break;
                case 9: answer += "j";   break;
            }
            switch (ageDv2){
                case 0: answer += "a";   break;
                case 1: answer += "b";   break;
                case 2: answer += "c";   break;
                case 3: answer += "d";   break;
                case 4: answer += "e";   break;
                case 5: answer += "f";   break;
                case 6: answer += "g";   break;
                case 7: answer += "h";   break;
                case 8: answer += "i";   break;
                case 9: answer += "j";   break;
            }
        }else if(ageDv1>=10 && ageDv1<100){		//age가 100의 자리 일때
            int ageDv3 = age/100;
            int ageDv4 = age%100;
            switch (ageDv3){
                case 0: answer += "a";   break;
                case 1: answer += "b";   break;
                case 2: answer += "c";   break;
                case 3: answer += "d";   break;
                case 4: answer += "e";   break;
                case 5: answer += "f";   break;
                case 6: answer += "g";   break;
                case 7: answer += "h";   break;
                case 8: answer += "i";   break;
                case 9: answer += "j";   break;
            }
            switch (ageDv4/10){
                case 0: answer += "a";   break;
                case 1: answer += "b";   break;
                case 2: answer += "c";   break;
                case 3: answer += "d";   break;
                case 4: answer += "e";   break;
                case 5: answer += "f";   break;
                case 6: answer += "g";   break;
                case 7: answer += "h";   break;
                case 8: answer += "i";   break;
                case 9: answer += "j";   break;
            }
            switch (ageDv4%10){
                case 0: answer += "a";   break;
                case 1: answer += "b";   break;
                case 2: answer += "c";   break;
                case 3: answer += "d";   break;
                case 4: answer += "e";   break;
                case 5: answer += "f";   break;
                case 6: answer += "g";   break;
                case 7: answer += "h";   break;
                case 8: answer += "i";   break;
                case 9: answer += "j";   break;
            }
        }else{
            answer = "baaa";				//age가 1000일 때
        }       
        return answer;
    }
}

 

 

class Solution {
    public String solution(int age) {
        String answer = "";
       String st = age + "";	//age를 배열로 만들기 위해 String으로 변환
        String splitst[] = st.split("");	//age원소 각각 하나씩 접근 위한 배열 생성

		//age원소 각각 하나씩 접근해 숫자를 문자로 변환
        for (int i=0; i<splitst.length; i++){
            switch (splitst[i]) {
                case "0":answer += "a"; break;
                case "1":answer += "b"; break;
                case "2":answer += "c"; break;
                case "3":answer += "d"; break;
                case "4":answer += "e"; break;
                case "5":answer += "f"; break;
                case "6":answer += "g"; break;
                case "7":answer += "h"; break;
                case "8":answer += "i"; break;
                case "9":answer += "j"; break;
            }
        }    
        return answer;
    }
}