HDU1159最长公共子序列

/**
*@ author StormMaybin
*@ date 2016-09-29
*/

–

生命不息，奋斗不止！

题目描述

Problem Description
A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X =

演示代码

package com.stormma.dp;

import java.io.BufferedInputStream;
import java.util.Scanner;

public class Main1159
{

    /**
     * @param args
     */
    private Scanner scan = null;
    public Main1159 ()
    {
        scan = new Scanner(new BufferedInputStream(System.in));
        while (scan.hasNext())
        {
            String a = scan.next();
            String b = scan.next();

            int [][] dp = new int [a.length()+1][b.length()+1];


            for (int i = 0; i < a.length(); i++)
            {
                for (int j = 0; j < b.length(); j++)
                {
                    if (a.charAt(i) == b.charAt(j))
                    {
                        dp[i+1][j+1] = dp[i][j] + 1;
                    }
                    else
                    {
                        dp[i+1][j+1] = Math.max(dp[i][j+1], dp[i+1][j]);
                    }
                }
            }
            System.out.println(dp[a.length()][b.length()]);
        }
    }
    public static void main(String[] args)
    {
        // TODO Auto-generated method stub
        new Main1159();
    }
}