문제
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에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.