代码搜索：Subsequence
找到约 105 项符合「Subsequence」的源代码
代码结果 105
www.eeworm.com/read/272894/10937418
dpr ex.dpr
program Ural_1219(Input, Output);
{
Every letter occurs not more than 40 000 times in the sequence;
26P1=26
1,000,000/26 < 40,000
Every possible subsequence with two letters length occurs not mor
www.eeworm.com/read/270963/11017621
cpp 11-02-01-2.cpp
#include
#include
#include
using namespace std;
template
struct congruent {
congruent(Integer mod) : N(mod) {}
bool operator()(Integer a, Integer
www.eeworm.com/read/270548/11033328
m split_train_test.m
function [train,test] = split_train_test(sample, trainPercentage)
% SPLIT_TRAIN_TEST splits the "sample" time series into a train and a
% test subsequence such that the train subsequence has a le
www.eeworm.com/read/466944/7024146
java maxsumtest.java
public final class MaxSumTest
{
/* START: Fig02_05.txt */
/**
* Cubic maximum contiguous subsequence sum algorithm.
*/
public static int maxSubSum1( int [ ] a )
www.eeworm.com/read/302926/13824770
java maxsumtest.java
public final class MaxSumTest
{
/**
* Cubic maximum contiguous subsequence sum algorithm.
*/
public static int maxSubSum1( int [ ] a )
{
int maxSum = 0;
for( int
www.eeworm.com/read/406523/11440540
cpp lcs.cpp
/************ hw5_LCS_s95610047 ************/
#include
#include
using namespace std;
int main(void)
{
int i, j;
int m, n;
cout
www.eeworm.com/read/406438/11442354
cpp lcs.cpp
#include
#include
using namespace std;
int main(void)
{
int i, j;
int m, n;
cout
www.eeworm.com/read/128476/14294822
java maxsumtest.java
public final class MaxSumTest
{
/* START: Fig02_05.txt */
/**
* Cubic maximum contiguous subsequence sum algorithm.
*/
public static int maxSubSum1( int [ ] a )