1/20 HTTP + 전화번호목록 + 위장

[skarltjr]

package algo;


import java.util.Arrays;
import java.util.Comparator;

public class Solution {
    public boolean solution(String[] phone_book) {
        boolean answer = true;

        Arrays.sort(phone_book, new Comparator<String>() {
            @Override
            public int compare(String o1, String o2) {
                return Integer.compare(o1.length(), o2.length());
            }
        });
        //문자열 길이대로 정렬
        for (int i = 0; i < phone_book.length; i++) {
            for (int j = 0; j < phone_book.length; j++) {
                if (phone_book[j].startsWith(phone_book[i]) && i!=j) {
                    return false;
                }
            }
        }

        return answer;
    }
}

[skarltjr]

package algo;


import java.util.HashSet;
import java.util.Set;

public class Solution {
    public int solution(String[][] clothes) {
        int answer = 1;
        Set<String> set = new HashSet<>();
        // 총 몇종류의 의상이 있는가 확인
        for (int i = 0; i < clothes.length; i++)
        {
            set.add(clothes[i][1]);
        }
        String[] kinds = new String[set.size()];
        int count = 0;
        for (String s : set)
        {
            kinds[count++] = s;
        }
        int[] kinds_count = new int[set.size()];

        //각각 clothes 돌면서 의상에 해당하는 index값 ++
        for (int i = 0; i < clothes.length; i++)
        {
            for (int j = 0; j < kinds.length; j++)
            {
                if (clothes[i][1].equals(kinds[j])) // String 은 레퍼런스타입 ==비교가아니다
                {
                    kinds_count[j]++;
                }
            }
        }

        for (int i = 0; i < kinds_count.length; i++) {
            answer *= (kinds_count[i] + 1);
        }


        return answer-1;
    }
}