코딩테스트/프로그래머스
[프로그래머스] n의 배수 고르기
애플쩀
2022. 11. 20. 14:45
import java.util.*;
class Solution {
public static int[] solution(int n, int[] numlist) {
List<Integer> list=new ArrayList<>();
for (int i = 0; i < numlist.length; i++) {
if(numlist[i]%n==0) {
list.add(numlist[i]);
}
}
int[] answer=new int[list.size()];
for (int i = 0; i < list.size(); i++) {
answer[i]=list.get(i);
}
return answer;
}
}
ArrayList -> 배열
1)반복문
int[] answer=new int[list.size()];
for (int i = 0; i < list.size(); i++) {
answer[i]=list.get(i);
}
2)toArray
int[] answer=list.stream().mapToInt(Integer::intValue).toArray();