代码搜索：Subsequence
找到约 105 项符合「Subsequence」的源代码
代码结果 105
www.eeworm.com/read/162614/5522318
c overload36.c
// { dg-do run }
// Test for subsequence checking in overload resolution.
class foo {
public:
void operator
www.eeworm.com/read/281000/10273964
cpp fig02_05.cpp
/**
* Cubic maximum contiguous subsequence sum algorithm.
*/
int maxSubSum1( const vector & a )
{
int maxSum = 0;
for( int i = 0; i < a.size( ); i++ )
for( int j = i; j
www.eeworm.com/read/281000/10274129
cpp fig02_06.cpp
/**
* Quadratic maximum contiguous subsequence sum algorithm.
*/
int maxSubSum2( const vector & a )
{
int maxSum = 0;
for( int i = 0; i < a.size( ); i++ )
{
int th
www.eeworm.com/read/266379/11229286
cpp fig02_05.cpp
/**
* Cubic maximum contiguous subsequence sum algorithm.
*/
int maxSubSum1( const vector & a )
{
int maxSum = 0;
for( int i = 0; i < a.size( ); i++ )
for( int j = i; j
www.eeworm.com/read/266379/11229397
cpp fig02_06.cpp
/**
* Quadratic maximum contiguous subsequence sum algorithm.
*/
int maxSubSum2( const vector & a )
{
int maxSum = 0;
for( int i = 0; i < a.size( ); i++ )
{
int th
www.eeworm.com/read/335381/12531154
htm sea_8558.htm
search, search_n
Click on the banner to return to the Class Reference home page.
©Copy
www.eeworm.com/read/335381/12531271
htm sea_5086.htm
search, search_n
Click on the banner to return to the Class Reference home page.
©Copy
www.eeworm.com/read/255347/12085895
txt lcs.txt
#include "stdafx.h"
#include
#include
using namespace std;
void longest_common_subsequence(string a,string b)
{
int count,i,j,flag;
//---------------获取两个要评估的字符串的长度
www.eeworm.com/read/281000/10274030
cpp fig02_08.cpp
/**
* Linear-time maximum contiguous subsequence sum algorithm.
*/
int maxSubSum4( const vector & a )
{
int maxSum = 0, thisSum = 0;
for( int j = 0; j < a.size( ); j++ )
{