longest Common Substring - Java java.lang

Java examples for java.lang:String Algorithm

  1. HOME
  2. Java
  3. java.lang
  4. String Algorithm

Description

longest Common Substring

Demo Code


//package com.java2s;

public class Main {
    public static String longestCommonSubstring(String S1, String S2) {
        int Start = 0;
        int Max = 0;
        for (int i = 0; i < S1.length(); i++) {
            for (int j = 0; j < S2.length(); j++) {
                int x = 0;
                while (S1.charAt(i + x) == S2.charAt(j + x)) {
                    x++;//w w  w  .ja va 2s  . c  o m
                    if (((i + x) >= S1.length())
                            || ((j + x) >= S2.length()))
                        break;
                }
                if (x > Max) {
                    Max = x;
                    Start = i;
                }
            }
        }
        return S1.substring(Start, (Start + Max));
    }
}

Related Tutorials