[0단계/1점] 팩토리얼

i! <=n 을 만족하는 팩토리얼 찾기

class Solution {
    public int solution(int n) {
        int answer = 1;
        int factorial = 1;
        while(factorial*(answer+1)<=n){
            answer++;
            factorial*=answer;
        }
        return answer;
    }
}