1 最长公共子序列(just work 递归实现)

#include<stdlib.h>
#include<stdio.h>
int lcs(char a[], char b[],int na,int nb,int j);
int main(void){
    char a[]="abcdefg";
    char b[]="bdcedeabf";
    int na=7;
    int nb=9;
    int j=0;
    int l=lcs(a,b,na,nb,j);
    printf("%d",l);
    return 0;
}

int lcs(char a[], char b[],int na,int nb,int j){
    if(na==0 || nb==0){
        return j;
    }
    if(a[na-1]==b[nb-1]){
        return lcs(a,b,na-1,nb-1,j+1);
    }else{
        int left = lcs(a,b,na-1,nb,j);
        int right = lcs(a,b,na,nb-1,j);
        return left>right?left:right;
    }
}