题目1042：Coincidence

题目描述：

Find a longest common subsequence of two strings.

输入：

First and second line of each input case contain two strings of lowercase character a…z. There are no spaces before, inside or after the strings. Lengths of strings do not exceed 100.

输出：

For each case, output k – the length of a longest common subsequence in one line.

样例输入：

abcd
cxbydz

样例输出：

2

import java.util.Scanner;
 
 
public class Main{
    public static void main(String[]args){
    Scanner in=new Scanner(System.in);
    while(in.hasNext()){
        String x=in.nextLine();
        String y=in.nextLine();
        int lenx=x.length();
        int leny=y.length();
        int[][]F=new int[lenx+1][leny+1];
        for(int i=0;i<=lenx;i++) F[i][0]=0; 
        for(int i=0;i<=leny;i++) F[0][i]=0;
        for(int i=1;i<=lenx;i++){
        char cx=x.charAt(i-1);
        for(int j=1;j<=leny;j++){
            char cy=y.charAt(j-1);
            if(cx==cy){
            F[i][j]=F[i-1][j-1]+1;
            }
            else{
            F[i][j]=Math.max(F[i-1][j],F[i][j-1]);
            }
        }
        }
        System.out.println(F[lenx][leny]);
    }
    }
 }
 
/**************************************************************
    Problem: 1042
    User: 0000H
    Language: Java
    Result: Accepted
    Time:80 ms
    Memory:15432 kb
****************************************************************/