最长字符序列

import java.util.Scanner;


public class 最长字符序列 {
static int count=0;
public static void print(int line,int column,int temp[][]) {
if(line!=0 && column!=0)
{
if(temp[line][column]==1)
{
count++;
print(line-1, column-1, temp);
}
else if(temp[line][column]==2)
{
print(line, column-1, temp);
}
else
{
print(line-1, column, temp);
}
}
}
public static void fun(char arr1[],char arr2[],int line,int column,int arr[][],int temp[][]) {
for(int i=0;i<=column;i++)
{
arr[0][i]=0;
}
for(int i=0;i<=line;i++)
{
arr[i][0]=0;
}
for(int i=1;i<=line;i++)
{
for(int j=1;j<=column;j++)
{
if(arr1[i-1]==arr2[j-1])
{
arr[i][j]=arr[i-1][j-1]+1;
temp[i][j]=1;
}
else
{
if(arr[i-1][j]>=arr[i][j-1])
{
arr[i][j]=arr[i-1][j];
temp[i][j]=3;
}
else
{
arr[i][j]=arr[i][j-1];
temp[i][j]=2;
}
}
}
}
}
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);

String string1=scanner.next();
String string2=scanner.next();
char arr1[]=string1.toCharArray();
char arr2[]=string2.toCharArray();
int len1=arr1.length;
int len2=arr2.length;
int arr[][]=new int[len1+1][len2+1];
int temp[][]=new int[len1+1][len2+1];
count=0;
fun(arr1,arr2,len1,len2,arr,temp);
print(len1,len2,temp);
System.out.println(count);

}

}

猜你喜欢

转载自www.cnblogs.com/shiaguang/p/12340281.html