[알고리즘] 카운트 다운 Java

 

import java.util.Arrays;
import java.util.Comparator;
import java.util.stream.IntStream;

class Solution {
    public int[] solution(int start, int end) {
        Integer[] ints = IntStream.rangeClosed(end, start).boxed().toArray(Integer[]::new);
        Arrays.sort(ints, Comparator.reverseOrder());
        return Arrays.stream(ints).mapToInt(i -> i).toArray();
    }
}

 

import java.util.stream.*;
import java.util.*;

class Solution {
    public int[] solution(int start, int end) {
        return IntStream.rangeClosed(end, start).boxed().collect(Collectors.toList()).stream().sorted(Comparator.reverseOrder()).mapToInt(Integer::intValue).toArray();
    }
}

 

class Solution {
    public int[] solution(int start, int end) {
        int[] answer = new int[start-end+1];
        for(int i=0; i<=start-end; i++) {
            answer[i] = start - i;
        }
        return answer;
    }
}