输出最长字符串链

package com.English1;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class English1 {
    public static void main(String[] args) throws FileNotFoundException {
        File file = new File("D:\\Eclipse workspace\\English\\input1.txt");// 读取文件
        if (!file.exists()) {// 如果文件打不开或不存在则提示错误
            System.out.println("文件不存在");
            return;
        }else {
            if(file.exists() && file.length() == 0) {  
                System.out.println("文件为空！");  
                return;
            }  
        }
        long startTime = System.currentTimeMillis();
        String[] strs=new String[1000000];
        Scanner x = new Scanner(file);
        int i=0;
        boolean flag=false;
        while(x.hasNextLine()) {
            String[] str=x.nextLine().split("\\W+");
            for(int ms=0;ms<str.length;ms++) {
                if(!str[ms].equals("")&&str[ms].length()>2) {
                    flag=false;
//                    System.out.println(str[ms]);
                    if(i!=0) {
                        for(int t=0;t<i;t++) {
                            if(!str[ms].equals(strs[t])) {
                                flag=true;
                            }
                        }
                    }else {
                        flag=true;
                    }
                    
                    if(flag) {
                        strs[i]=str[ms];
                        i++;
                    }
                    
                }
                
            }
        }
        if(i==1) {
            System.out.println("该文件只有一个单词！无法实现词语接龙");
        }
        String sentence = "";
        String word="";
        String max="";
        for(int m=0;m<i;m++) {
            sentence = strs[m];
            word = sentence;
            for(int j=m+1;j<i;j++) {
                if(strs[j].toLowerCase().subSequence(0, 1).equals(word.toLowerCase().subSequence(word.length()-1, word.length()))) {
                    word = strs[j];
                    sentence+="-"+word;
                }
            }
            
            if(sentence.indexOf("-")!=-1) {
                if(sentence.length()>max.length()) {
                    max = sentence;
                }
//                System.out.println(sentence);
            }
            
        }
        long endTime = System.currentTimeMillis();
        System.out.println(endTime-startTime+"ms");
        System.out.println(i);
        if(max.length()!=0) {
            System.out.println(max);
        }else {
            System.out.println("没有首尾相连");
        }
        
    }
}