diff --git a/.idea/.name b/.idea/.name new file mode 100644 index 0000000..7fed7c3 --- /dev/null +++ b/.idea/.name @@ -0,0 +1 @@ +Java-programmers \ No newline at end of file diff --git a/.idea/gradle.xml b/.idea/gradle.xml new file mode 100644 index 0000000..7d3b3e8 --- /dev/null +++ b/.idea/gradle.xml @@ -0,0 +1,17 @@ + + + + + + + \ No newline at end of file diff --git a/.idea/misc.xml b/.idea/misc.xml new file mode 100644 index 0000000..25d34a4 --- /dev/null +++ b/.idea/misc.xml @@ -0,0 +1,5 @@ + + + + + \ No newline at end of file diff --git a/.idea/vcs.xml b/.idea/vcs.xml new file mode 100644 index 0000000..35eb1dd --- /dev/null +++ b/.idea/vcs.xml @@ -0,0 +1,6 @@ + + + + + + \ No newline at end of file diff --git a/src/main/java/org/example/solution1.java b/src/main/java/org/example/solution1.java index cadc0ab..66d17f8 100644 --- a/src/main/java/org/example/solution1.java +++ b/src/main/java/org/example/solution1.java @@ -1,15 +1,12 @@ package org.example; public class solution1 { - public double solution(int[] arr) { - double answer = 0; - double tot =0; - for(int i: arr){ - tot += i; - } - answer = tot/(arr.length); + //짝수와 홀수 + public String solution(int num) { + String answer = ""; + if(num % 2 == 0) answer = "Even"; + else answer = "Odd"; return answer; - //커밋연습 } } diff --git a/src/main/java/org/example/solution2.java b/src/main/java/org/example/solution2.java new file mode 100644 index 0000000..07d392d --- /dev/null +++ b/src/main/java/org/example/solution2.java @@ -0,0 +1,14 @@ +package org.example; + +public class solution2 { + //평균 구하기 + public double Solution(int[] arr) { + int n = arr.length; + int sum = 0; + for(int i = 0; i < n; i++) { + sum += arr[i]; + } + double average = (double) sum / n; + return average; + } +} diff --git a/src/main/java/org/example/solution3.java b/src/main/java/org/example/solution3.java new file mode 100644 index 0000000..f2df6fd --- /dev/null +++ b/src/main/java/org/example/solution3.java @@ -0,0 +1,17 @@ +package org.example; + +public class solution3 { + //자릿수 더하기 + public int solution(int n) { + int answer = 0; + String num = String.valueOf(n); + for(char x : num.toCharArray()) { + answer += Integer.parseInt(String.valueOf(x)); + } + return answer; + } + /* + 1. 정수 n을 문자열로 변환 + 2. 문자열을 문자 단위로 반복하며 각 문자를 정수로 바꾸고 answer에 누적 + */ +} diff --git a/src/main/java/org/example/solution4.java b/src/main/java/org/example/solution4.java new file mode 100644 index 0000000..97365a3 --- /dev/null +++ b/src/main/java/org/example/solution4.java @@ -0,0 +1,18 @@ +package org.example; + +public class solution4 { + // 문자열 내 p와 y의 개수 + public boolean solution(String s) { + boolean answer = true; + String py = s.toLowerCase(); + int p = 0, y = 0; + + for(char x : py.toCharArray()) { + if(x == 'p') p++; + if (x == 'y') y++; + } + if(p != y) answer = false; + + return answer; + } +} diff --git a/src/main/java/org/example/solution5.java b/src/main/java/org/example/solution5.java new file mode 100644 index 0000000..6e8272b --- /dev/null +++ b/src/main/java/org/example/solution5.java @@ -0,0 +1,14 @@ +package org.example; + +public class solution5 { + //나머지가 1이 되는 수 찾기 + public int solution(int n) { + //나머지가 1이 되려면 1보다 커야하므로 2부터 시작 + for(int i = 2; i < n; i++) { + if(n % i == 1) return i; + //수를 찾으면 종료 + } + return 0; + } + +} diff --git a/src/main/java/org/example/solution6.java b/src/main/java/org/example/solution6.java new file mode 100644 index 0000000..c698c1d --- /dev/null +++ b/src/main/java/org/example/solution6.java @@ -0,0 +1,15 @@ +package org.example; + +public class solution6 { + //문자열 다루기 기본 + public boolean solution(String s) { + boolean answer = true; + int n = s.length(); + if(n != 4 && n != 6) return false; //조건 불만족시 종료 + for(char c : s.toCharArray()) { + //int 형으로 바꾼 문자가 숫자 범위 바깥이라면 false 반환. + if( (int) c < 48 || (int) c > 57) return false; + } + return answer; + } +} diff --git a/src/main/java/org/example/solution7.java b/src/main/java/org/example/solution7.java new file mode 100644 index 0000000..0af7d94 --- /dev/null +++ b/src/main/java/org/example/solution7.java @@ -0,0 +1,14 @@ +package org.example; + +public class solution7 { + public boolean solution(int x) { + boolean answer = false; + String num = Integer.toString(x); //문자열로 변환 + int sum = 0; + for(char c : num.toCharArray()) { + sum += (int) c - '0'; //숫자로 변환 + } + if(x % sum == 0) answer = true; //하샤드 수인지 확인 + return answer; + } +} diff --git a/src/main/java/org/example/solution8.java b/src/main/java/org/example/solution8.java new file mode 100644 index 0000000..1369372 --- /dev/null +++ b/src/main/java/org/example/solution8.java @@ -0,0 +1,15 @@ +package org.example; + +public class solution8 { + //서울에서 김서방 찾기 + String answer = ""; + public String solution(String[] seoul) { + for(int i = 0; i < seoul.length; i++) { + if(seoul[i].equals("Kim")) { + return "김서방은 " + i + "에 있다"; + } + } + + return answer; + } +} diff --git a/src/main/java/org/example/solution9.java b/src/main/java/org/example/solution9.java new file mode 100644 index 0000000..1c39c15 --- /dev/null +++ b/src/main/java/org/example/solution9.java @@ -0,0 +1,16 @@ +package org.example; + +public class solution9 { + //콜라츠 추측 + public long solution(long num) { + long answer = 0; + if(num == 1) return 0; + while(num != 1) { + if(answer >= 500) return -1; + if(num % 2 == 0) num /= 2; + else num = num*3 + 1; + answer++; + } + return answer; + } +}