समस्या
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.
सीमाएँ
Each array has 0…1,000 integers between −1,000,000,000 and 1,000,000,000. Duplicates are allowed.
उदाहरण
इनपुट:
first = [1, 3, 2, 4]
second = [3, 1, 2, 4]
अपेक्षित आउटपुट:
expected = 3इनपुट:
std::vector<long long> first = {1, 3, 2, 4};
std::vector<long long> second = {3, 1, 2, 4};
अपेक्षित आउटपुट:
long long expected = 3;इनपुट:
long[] first = new long[] {1, 3, 2, 4};
long[] second = new long[] {3, 1, 2, 4};
अपेक्षित आउटपुट:
long expected = 3;व्याख्या
Both contain [1, 2, 4] in that order, after deleting one value. The original arrays differ, so a length-four match is impossible.
इनपुट:
first = [1, 2]
second = [3, 4]
अपेक्षित आउटपुट:
expected = 0इनपुट:
std::vector<long long> first = {1, 2};
std::vector<long long> second = {3, 4};
अपेक्षित आउटपुट:
long long expected = 0;इनपुट:
long[] first = new long[] {1, 2};
long[] second = new long[] {3, 4};
अपेक्षित आउटपुट:
long expected = 0;व्याख्या
The arrays have no shared value, so their only common subsequence is empty.
संदर्भ
यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।