UVa 10405 - Longest Common Subsequence

最新推荐文章于 2022-11-08 00:27:06 发布

annie11640389

最新推荐文章于 2022-11-08 00:27:06 发布

阅读量583

点赞数

分类专栏： uva 文章标签： 10405 Longest Common Subse

本文链接：https://blog.csdn.net/annie11640389/article/details/9107687

版权

uva 专栏收录该内容

34 篇文章 0 订阅

订阅专栏

/*UVa 10405 - Longest Common Subsequence
 * */
import java.util.Scanner;

class Main {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		while (scanner.hasNext()) {
			String s1 = scanner.nextLine();
			s1 = "a" + s1;//在字符串前面增加一个字符，这样就可以避免判断数组越界的问题
			String s2 = scanner.nextLine();
			s2 = "b" + s2;
			char[] c1 = s1.toCharArray();
			char[] c2 = s2.toCharArray();
			int n1 = s1.length();
			int n2 = s2.length();
			int[][] c = new int[n1][n2];
			for (int i = 1; i < n1; i++) {
				for (int j = 1; j < n2; j++) {
					if (c1[i] == c2[j]) {
						c[i][j] = c[i - 1][j - 1] + 1;
					} else if (c[i - 1][j] >= c[i][j - 1])
						c[i][j] = c[i - 1][j];
					else
						c[i][j] = c[i][j - 1];
				}
			}
			System.out.println(c[n1 - 1][n2 - 1]);
		}
	}
}