Skip to content

초급반 / 이승언 / 단어뒤집기2-17413, 파일정리-20291, ZOAC-30436 #107

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 2 commits into
base: main
Choose a base branch
from

Conversation

banasu0723
Copy link
Contributor

ZOAC3 는 풀다가 못풀어서 .... 일단 한 것 까지 올리겠습니다 !

Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

  1. 스택 자료구조를 이용해서 단어 뒤집는 로직을 잘 구현했어요!

int N = Integer.parseInt(st.nextToken());

// 확장자별 파일개수를 저장할 맵
Map<String, Integer> fileCount = new HashMap<>();
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

여기서 HashMap 대신에 TreeMap 사용하면 key값에 따라서 자동으로 정렬되어서 밑에서 사전순 정렬을 아낄수 있어서 더 좋은 방안이 될거 같아요!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants