Skip to content
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

스파르타 알고리즘 트랙 1주차 숙제 #5

Closed
3 tasks done
choichanhyeok opened this issue Aug 3, 2022 · 0 comments · Fixed by #6
Closed
3 tasks done

스파르타 알고리즘 트랙 1주차 숙제 #5

choichanhyeok opened this issue Aug 3, 2022 · 0 comments · Fixed by #6
Assignees
Labels

Comments

@choichanhyeok
Copy link
Owner

choichanhyeok commented Aug 3, 2022

🎵 설명

  • Why?
    : 보다 오래 기억하기 위해 1주차 숙제에 대한 정리 및 문서화

  • How?
    : 자바독과 주석을 통해 문서화
    : (1) 입력 숫자까지의 소수 찾기
    : (2) 2진 문자열에서 일관적으로 연속된 문자열을 뒤집어 한 문자로 통일되게 하는 최소 횟수 찾기
    : (3) 문자열을 알파벳과 빈도수로 요약

✅ 이슈 만들 때 체크하셨나요?

  • 할당 (Assignees)
  • 라벨(Labels)
  • 프로젝트(Projects)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Development

Successfully merging a pull request may close this issue.

1 participant