java单位数_java – 优化代码以查找给定数量N的阶乘的单位数

我在竞赛中尝试了一个问题,其确切陈述是这样的：

Given a number N. The task is to find the unit digit of factorial of given

number N.

Input:

First line of input contains number of testcases T. For each testcase, there

will be a single line containing N.

Output:

For each testcase, print the unit digit of factorial of N.

Constraints:

1 <= T <= 1000

1 <= N <= 1018

并提出以下代码：

import java.util.*;

import java.lang.*;

import java.io.*;

class GFG {

public static void main (String[] args) throws IOException{

BufferedReader reader =

new BufferedReader(new InputStreamReader(System.in));

int cases = Integer.parseInt(reader.readLine());

int i=0;

while(i

fact(Integer.parseInt(reader.readLine()));i++;

}

}

static void fact(int num){

int j,fact=1;

for(j=1;j<=num;j++){

fact=fact*j;

}

System.out.println(fact%10);

}

}

当使用自定义输入执行时,它会提供正确的输出,但是当尝试所有测试用例时,它会给出：“超出时间限制.优化代码”.我试图使用bufferedReader而不是Scanner类,但没有效果.我无法找到如何进一步优化此代码.有什么我想念的吗？