如何从字符串列表中找到最长的通用后缀并在Java中返回结果后缀长度？

Question

请在ArrayList或LinkedList中考虑以下内容：[Gloucestershire，Hampshire，Yorkshire，Lancashire] shire是长度为5的最长的通用后缀。输出应为5我如何编写一种方法来实现上述和返回长度

Answer 1

Try this.
Explanation is in the comments

package javaapplication1;
public class SegmentTree {

    public static void main(String[] args) {
        String[] array = {"Gloucestershire", "Hampshire", "Yorkshire", "Lancashire"};
        int i,j;
        int min=10000000;

        //reversing the strings and finding the length of smallest string
        for(i=0;i<(array.length);i++)
        {
          if(array[i].length()<min)
              min=array[i].length();


         StringBuilder input1 = new StringBuilder();
         input1.append(array[i]);
         array[i] = input1.reverse().toString();
        }

        //finding the length of longest suffix

        for(i=0;i<min;i++)
        {
          for(j=1;j<(array.length);j++)
          {
              if(array[j].charAt(i)!=array[j-1].charAt(i))
              {
                break;
              }
          }
          if(j!=array.length)
              break;
        }

        System.out.println(i);
    }
}

What I am doing here is,first checking the last elem of all strings, then 2nd last and so on.

Time Complexity: O(n*m) ,
n=number of strings, m=length of smallest string

Answer 2

Guava has a helper function called Strings.commonSuffix(CharSequence a, CharSequence b) that could be used in your algorithm. I know adding dependency like Guava only to have this function can be overkill - in this case you can take a look at the source code to see how this function is implemented and you can move this implementation to your program. Then your program could look like this:

import com.google.common.base.Strings;

import java.io.IOException;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;

public class CommonSuffixLengthMain {

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

        assert 5 == commonSuffixLength(Arrays.asList("Gloucestershire", "Hampshire", "Yorkshire", "Lancashire"));

        assert 2 == commonSuffixLength(Arrays.asList("abc", "dbc", "qebc", "webc"));

        assert 0 == commonSuffixLength(Collections.emptyList());

        assert 0 == commonSuffixLength(Collections.singletonList("abc"));

        assert 0 == commonSuffixLength(Arrays.asList("abc", "def", "zxc"));
    }

    private static int commonSuffixLength(final List<String> strings) {
        int result = 0;

        if (strings == null || strings.size() < 2) {
            return result;
        }

        for (int i = 0; i < strings.size() - 1; i++) {
            String prefix = Strings.commonSuffix(strings.get(i), strings.get(i + 1));
            result = result == 0 ?
                    prefix.length() :
                    Math.min(prefix.length(), result);
        }

        return result;
    }
}