4 个答案
土猿
答案时间:2021-02-04
public static void readFile(){
File file = new File("c:/WINDOWS");
File[] files = file.listFiles();
long min=Integer.MAX_VALUE,max=0;
File maxFile = null,minFile=null;
for (File f :files){
if (f.isDirectory()){
continue;
}else {
if (f.length()>max){
max=f.length();
maxFile=f;
}
if (f.length()!=0 && f.length()
min=f.length();
minFile=f;
}
}
}
System.out.println("最大的文件是:"+maxFile.getAbsolutePath()+",其大小是"+max+"字节");
System.out.println("最小的文件是:"+minFile.getAbsolutePath()+",其大小是"+min+"字节");
}
DQ970913
答案时间:2021-02-03
public class TestFile {
public static void main(String[] args) {
long max=0,min;
int countMax=0,countMin=0;
File f=new File("C:/WINDOWS");
File[] files=f.listFiles();
for(File element: files){
System.out.println(element);
}
min=Long.MAX_VALUE;
for (int i=0;i<= files.length-2;i++){
if(files[i].length()>=files[i+1].length()&&files[i].length()>=max){
max=files[i].length();
countMax=i;
}
else if(files[i+1].length()!=0 && files[i].length()>=files[i+1].length()&&files[i+1].length()<=min) {
min = files[i + 1].length();
countMin=i+1;
}
}
System.out.println("最大的文件是:"+files[countMax]+" 大小为:"+max+"字节");
System.out.println("最小的文件是:"+files[countMin]+" 大小为:"+min+"字节");
}
}
最拉分的小旋风
答案时间:2021-02-01
import java.io.File;
public class TestFile {
public static void main(String[] args) {
File rootFile=new File("c:/windows/");
File maxF=null;
File minF=null;
Long maxLen = Long.MIN_VALUE;
Long minLen=Long.MAX_VALUE;
File[] fs=rootFile.listFiles();
for(int i=0;i
if(fs[i].isDirectory() || fs[i].length()==0){
continue;
}
if(fs[i].length()>maxLen){
maxLen=fs[i].length();
maxF=fs[i];
}
if(fs[i].length()
minLen=fs[i].length();
minF=fs[i];
}
}
System.out.printf("最大的文件名为:%s,其长度为:%d",maxF.getName(),maxF.length());
System.out.println();
System.out.printf("最小的文件名为:%s,其长度为:%d",minF.getName(),minF.length());
}
}
kim-kim
答案时间:2021-01-03
package File;
import java.io.File;
public class Search {
public static void main(String args[]){
File f=new File("C:/WINDOWS");
File[] fs=f.listFiles();
long min=0;
out:
for(int i=0;i
if(fs[i].length()!=0){
min=fs[i].length();
break out;}
}
long max=0;
int k=0,m=0;
for( int i=0;i
if(fs[i].length()>max){
max=fs[i].length();
k=i;
}
if(fs[i].length()
min=fs[i].length();
m=i;
}
}
System.out.println("最大的文件是"+fs[k]+" 大小是"+fs[k].length());
System.out.println("最小的文件是"+fs[m]+" 大小是"+fs[m].length());
}
}