-
Notifications
You must be signed in to change notification settings - Fork 0
조주형 #2
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
jojuhyeong
wants to merge
2
commits into
main
Choose a base branch
from
jojuhyeong
base: main
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
조주형 #2
Changes from all commits
Commits
Show all changes
2 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,18 +1,15 @@ | ||
| package org.example; | ||
|
|
||
| public class solution1 { | ||
| class solution1 { | ||
| public double solution(int[] arr) { | ||
| double answer = 0; | ||
| double tot =0; | ||
| for(int i: arr){ | ||
| tot += i; | ||
|
|
||
| for(int i = 0; i < arr.length ; i++){ | ||
| answer += arr[i]; | ||
| } | ||
| answer = tot/(arr.length); | ||
| answer = answer/arr.length; | ||
|
|
||
| return answer; | ||
| } | ||
| } | ||
|
|
||
|
|
||
| // 주석에 쓸 내용 : 자신이 이 문제를 어떻게 풀었는지 쓰기, 어려워서 못 풀었으면 어떤 부분이 어려웠는지 남기기. | ||
| // solution1에 첫문제 풀고 다음날 부터 솔루션2,3,4.. 클래스 만들어서 풀고 커밋하기 | ||
| // gpt 사용금지. | ||
| //평균 구하기 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,16 @@ | ||
| package org.example; | ||
|
|
||
| class solution2 { | ||
| public String solution(int num) { | ||
| String answer = ""; | ||
| if(num % 2 == 0 ){ | ||
| answer = "Even"; | ||
| } | ||
| else{ | ||
| answer = "Odd"; | ||
| } | ||
|
|
||
| return answer; | ||
| } | ||
| } | ||
| //짝수와 홀수 | ||
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
깔끔한 코드 🤩