[알고리즘문제풀기] 가장 큰 수 찾기

문제

내가 작성한 정답

class Solution {
    public int[] solution(int[] array) {
        int[] answer = new int[2];
        for(int i=0; i<array.length; i++){
            if(array[i]>answer[0]) {
                answer[0] = array[i];
                answer[1] = i;
            }
        }
        return answer;
    }
}

import java.util.*;
import java.util.stream.*;
class Solution {
    public int[] solution(int[] array) {
        int[] answer = new int[2];
        List<Integer> temp = Arrays.stream(array).boxed().collect(Collectors.toList()); 
        Arrays.sort(array);
        answer[0] = array[array.length-1];
        answer[1] = temp.indexOf(answer[0]);
        return answer;
    }
}

다른 사람들의 정답

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

class Solution {
    public int[] solution(int[] array) {
        List<Integer> list = Arrays.stream(array).boxed().collect(Collectors.toList());
        int max = list.stream().max(Integer::compareTo).orElse(0);
        int index = list.indexOf(max);
        return new int[] {max, index};
    }
}