Longest Common Subsequence Length

A subsequence is formed by deleting zero or more elements while preserving the order of the remaining elements. Find the longest length shared by two arrays. Matching elements need not be adjacent. Return only the length, since several equally long subsequences may exist.

Implement longest_common_subsequence_length(first, second).

Input

first: The first sequence.

second: The second sequence.

Output

Return the maximum common subsequence length. If either array is empty, return 0.

Restrições

Each array has 0…1,000 integers between −1,000,000,000 and 1,000,000,000. Duplicates are allowed.

Exemplos

Entrada:
first = [1, 3, 2, 4]
second = [3, 1, 2, 4]

Saída esperada:
expected = 3

Entrada:
std::vector<long long> first = {1, 3, 2, 4};
std::vector<long long> second = {3, 1, 2, 4};

Saída esperada:
long long expected = 3;

Entrada:
long[] first = new long[] {1, 3, 2, 4};
long[] second = new long[] {3, 1, 2, 4};

Saída esperada:
long expected = 3;

Entrada:
first = [1, 2]
second = [3, 4]

Saída esperada:
expected = 0

Entrada:
std::vector<long long> first = {1, 2};
std::vector<long long> second = {3, 4};

Saída esperada:
long long expected = 0;

Entrada:
long[] first = new long[] {1, 2};
long[] second = new long[] {3, 4};

Saída esperada:
long expected = 0;

Referências

Este desafio foi adaptado para o CodeUtility. Siga o enunciado e as restrições acima.

• CSES: Longest Common Subsequence