{"componentChunkName":"component---src-templates-post-template-jsx","path":"/algo/posts/2021-03-19--001","result":{"data":{"site":{"siteMetadata":{"title":"Blog by Eunyoung","subtitle":"작업 기록 블로그","copyright":"© All rights reserved.","author":{"name":"EunYoung","twitter":"#"},"disqusShortname":"","url":"https://ssongey.github.io"}},"markdownRemark":{"id":"0cbb9885-f88c-5fb9-aef0-28e1846dbddb","html":"

문제

\n\n

\n \n \n \n \n \n \n \n \n \n

\n\n
public class MergeNames {\n    \n    public static String[] uniqueNames(String[] names1, String[] names2) {\n        throw new UnsupportedOperationException(\"Waiting to be implemented.\");\n    }\n    \n    public static void main(String[] args) {\n        String[] names1 = new String[] {\"Ava\", \"Emma\", \"Olivia\"};\n        String[] names2 = new String[] {\"Olivia\", \"Sophia\", \"Emma\"};\n        System.out.println(String.join(\", \", MergeNames.uniqueNames(names1, names2))); // should print Ava, Emma, Olivia, Sophia\n    }\n}
\n
\n

결과 및 풀이

\n\n

\n \n \n \n \n \n \n \n \n \n

\n\n
public String[] uniqueNames(String[] names1, String[] names2) {\n\n    Set<String> uniqueNameSet = new HashSet<>();\n\n    for(int i = 0, name1Len = names1.length, name2Len = names2.length, loopLen = Math.max(name1Len, name2Len);\n        i< loopLen; i++) {\n      if(name1Len > i) uniqueNameSet.add(names1[i]);\n      if(name2Len > i) uniqueNameSet.add(names2[i]);\n    }\n\n    return uniqueNameSet.stream().toArray(String[]::new);\n  }
\n
\n

배웠다

\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
HashSet순서가 필요없는 데이터를 hash table에 저장. Set 중에 가장 성능이 좋음
TreeSet저장된 데이터의 값에 따라 정렬됨. red-black tree 타입으로 값이 저장. HashSet보다 성능이 느림
LinkedHashSet연결된 목록 타입으로 구현된 hash table에 데이터 저장. 저장된 순서에 따라 값이 정렬. 셋 중 가장 느림
","fields":{"tagSlugs":["/tags/arrays/"],"slug":"/algo/posts/2021-03-19--001"},"frontmatter":{"title":"[TESTDOME] Merge Names","tags":["Arrays"],"date":"2021-03-19","description":"Arrays, 배열"}}},"pageContext":{"slug":"/algo/posts/2021-03-19--001"}},"staticQueryHashes":[]}