Algorithm

class gpp.algorithms.FenwickTree[source]: Bases: object

class gpp.algorithms.SegmentTree[source]: Bases: object

class gpp.algorithms.SegmentTreeLazyPropagation[source]: Bases: object

gpp.algorithms.longest_common_sequence(s1: str, s2: str) → int[source]

문자열 A, B의 최장 공통 문자열 길이

Parameters:

s1 (str) – 문자열 A
s2 (str) – 문자열 B

Returns:

최장 공통 문자열 길이

Return type:

int

Example:

>>> longest_common_sequence('a', 'b')
0
>>> longest_common_sequence('aa', 'ba')
1
>>> longest_common_sequence('aa', 'aba')
2
>>> longest_common_sequence('aa', 'ab')
1
>>> longest_common_sequence('abcd', 'ababadcd')
4
>>> longest_common_sequence('ababa', 'ababcd')
4
>>> longest_common_sequence('서울강남초등학교', '서울강남 사립초교')
6