代码搜索：Subsequence
找到约 105 项符合「Subsequence」的源代码
代码结果 105
www.eeworm.com/read/324447/3503217
g demo3.g
subsequence power( exponent )
{
whenever self->compute do
self->ready( $value ^ exponent )
}
square := power( 2 )
cube := power( 3 )
square->compute( 6 )
cube->compute( [2, 5, 10.1] )
wheneve
www.eeworm.com/read/323581/3514667
g demo3.g
subsequence power( exponent )
{
whenever self->compute do
self->ready( $value ^ exponent )
}
square := power( 2 )
cube := power( 3 )
square->compute( 6 )
cube->compute( [2, 5, 10.1] )
wheneve
www.eeworm.com/read/442927/7641711
m lcs_b.m
function [lcscount, lcsstring, ind1, ind2, lcstable] = lcs(a, b)
%LCS Longest (maximum) common subsequence
% Usage:
% [count, string, index1, index2, lcstable] = lcs(a, b)
% a: input string 1
% b
www.eeworm.com/read/333698/12664714
m lcs.m
function [lcscount, lcs_path, lcs_str, lcstable] = lcs(a, b)
% LCS Longest (maximum) common subsequence
% 侩过:
% [count, lcs_path, lcs_str, lcstable] = lcsm(a, b)
% a: 涝仿 巩磊凯 1
% b: 涝仿 巩磊凯 2
% c
www.eeworm.com/read/201428/15408564
txt 新建文本文档.txt
参考算法导论写的LCS算法，仿照STL的泛型风格，适用于多种STL容器中的各种类型数据构成的序列的最大公共子序列（Longest Common Subsequence）问题求解。
利用该模块AC了ZOJ 1939，算是检验合格了。
#include
#include
#include
#include