Skip to content

프로그래머스 나누어 떨어지는 숫자 배열 풀이 #98

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.

Sign up for GitHub

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

Merged
honux77 merged 1 commit into from
Feb 7, 2020
Merged

프로그래머스 나누어 떨어지는 숫자 배열 풀이 #98

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
24 changes: 24 additions & 0 deletions 200205/ksundong/DividingNumberArray/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,24 @@
import java.util.ArrayList;
import java.util.Arrays;

/**
* [나누어 떨어지는 숫자 배열](https://programmers.co.kr/learn/courses/30/lessons/12910)
* - [풀이](https://github.com/ksundong/algorithm-solution/blob/0007cfb4c168f48bf1f4597814fc715d6a33e685/src/main/java/dev/idion/programmers/dividingnumberarray/Solution.java)
* - 별로 깊게 생각해보지 않아도 되는 문제였다.
*/
public class Solution {
public int[] solution(int[] arr, int divisor) {
ArrayList<Integer> dividingArray = new ArrayList<>();
for (int i = 0; i < arr.length; i++) {
if (arr[i] % divisor == 0) dividingArray.add(arr[i]);
}
if (dividingArray.isEmpty()) return new int[]{-1};

int[] answer = new int[dividingArray.size()];
for (int i = 0; i < dividingArray.size(); i++) {
answer[i] = dividingArray.get(i);
}
Arrays.sort(answer);
return answer;
}
}
40 changes: 40 additions & 0 deletions 200205/ksundong/DividingNumberArray/SolutionTest.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,40 @@
import org.junit.jupiter.api.BeforeEach;
import org.junit.jupiter.api.Test;

import static org.junit.jupiter.api.Assertions.assertArrayEquals;

class SolutionTest {
Solution solution;

@BeforeEach
void setUp() {
solution = new Solution();
}

@Test
void testSolution1() {
int[] inputArray = {5, 7, 9, 10};
int inputdivisor = 5;
int[] expected = {5, 10};
int[] actual = solution.solution(inputArray, inputdivisor);
assertArrayEquals(expected, actual, "원하는 배열이 출력되지 않았습니다.");
}

@Test
void testSolution2() {
int[] inputArray = {2, 36, 1, 3};
int inputdivisor = 1;
int[] expected = {1, 2, 3, 36};
int[] actual = solution.solution(inputArray, inputdivisor);
assertArrayEquals(expected, actual, "원하는 배열이 출력되지 않았습니다.");
}

@Test
void testSolution3() {
int[] inputArray = {3, 2, 6};
int inputdivisor = 10;
int[] expected = {-1};
int[] actual = solution.solution(inputArray, inputdivisor);
assertArrayEquals(expected, actual, "원하는 배열이 출력되지 않았습니다.");
}
}