Java LCS lcs1(int[] A, int[] B)

Description

lcs

License

Apache License

Declaration

public static int lcs1(int[] A, int[] B) 

Method Source Code

//package com.java2s;
/*/*from www .  jav  a 2s  . com*/
 * org.fsola
 *
 * File Name: LongestCommonSubsequence.java
 *
 * Copyright 2014 Dzhem Riza
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

public class Main {
    public static int lcs1(int[] A, int[] B) {
        return lcs1impl(A, B, 0, 0);
    }

    public static int lcs1impl(int[] A, int[] B, int I, int J) {
        if (A.length <= I || B.length <= J) {
            return 0;
        }

        int max = 0;
        for (int i = I; i < A.length; ++i) {
            for (int j = J; j < B.length; ++j) {
                if (A[i] == B[j]) {
                    int c = lcs1impl(A, B, i + 1, j + 1) + 1;

                    if (max < c) {
                        max = c;
                    }
                }
            }
        }

        return max;
    }
}

Related

1. LCS(String input1, String input2)
2. lcs(String s1, int s1min, int s1max, String s2, int s2min, int s2max)
3. lcs(String s1, String s2)
4. lcs(String str1, String str2)
5. lcs(String X, String Y, int m, int n)
6. lcs2(int[] A, int[] B, int m, int n)
7. lcs3(int[] A, int[] B)
8. lcs4(int[] A, int[] B)
9. LCSAlgorithm(String a, String b)