Group, Greedy and Lazy in Regular Expression

 (…) means a group, group can have a name, form is: (?’groupname’…) or (?…)each group has a GroupID (from 1 to infinite), group 0 is the whole matche...

2011-06-16 16:50:00

阅读数:1206

评论数:0

对决算法

#include "stdio.h"#include #include #include //this programs file name is Game.cpp//this program is designed by 200624101101杨振平 on NOV 21th...

2010-02-26 09:15:00

阅读数:1011

评论数:0

二分覆盖

#include #include #include #include #include using namespace std; //this programs file name is coin.cpp//this program is designed by 200624101101...

2010-02-26 09:13:00

阅读数:1338

评论数:0

农民过河问题

#include #include #include //this program is edited by 200624101101杨振平//this papers edited time is DEC 5th,2008#define MAX_STEP 20 //index: 0 - 狼,...

2010-02-26 09:11:00

阅读数:1861

评论数:1

动态规划

//dynamic programming to seek shortest route#include //this program is edited by 200624101101杨振平//this papers edited time is DEC 3th,2008//define the...

2010-02-26 09:09:00

阅读数:1104

评论数:0

快速排序

#include //this program is edited by 200624101101杨振平//this papers edited time is Nov 7th,2008//define count of array#define N 9//main functionvoid ma...

2010-02-26 09:08:00

阅读数:1034

评论数:0

合并排序

#include //this program is edited by 200624101101杨振平//this papers edited time is Nov 7th,2008//define count of array#define N 9//main functionvoid ma...

2010-02-26 09:06:00

阅读数:1142

评论数:0

分治法

#include      // find the max value between a[m] and a[n]int getmax(int a[],int m, int n) {    int middle,max1,max2,max;        if( m==n ) max =a[m];...

2010-02-26 09:05:00

阅读数:1244

评论数:0

蛮力法

#include #include //200624101101杨振平//2008年11月4日21:43编写//the algorithm of the force methodvoid main(){ //the defination of printing menu function int ...

2010-02-26 09:04:00

阅读数:1075

评论数:0

KMP算法

//200624101101杨振平#include //全局变量计算比较次数int count=0;void main(){ //声明KMP算法的函数原型 int KMP(char S[],int n,char T[],int m); //初始化主串 char S[14]="ababca...

2010-02-26 09:02:00

阅读数:1151

评论数:0

BF算法

//200624101101杨振平#include //全局变量计算比较次数int count=0;//主函数void main(){ //声明BF算法的函数原型 int BF(char S[],int n,char T[],int m); //初始化主串 char S[14]="aba...

2010-02-26 09:01:00

阅读数:1421

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭