算法设计报告书.docVIP

软件121 金凯 1102052019 提交题目数：5题 ————————————————————————— 1.编程实现最长公共子序列 package com.kale.www; public class LCS { static int max = 100; public static int[][] calculate = new int[max][max]; /** * 用动态规划求最长公共子序列的长度 * * @param str01 * @param str02 */ static void lcs_length(String[] str01, String[] str02) { int str1_len = str01.length; int str2_len = str02.length; int i, j; for (i = 0; i str1_len; ++i) { calculate[i][0] = 0; } for (j = 0; j str2_len; ++j) { calculate[0][j] = 0; } for (i = 1; i = str1_len; ++i) { for (j = 1; j = str2_len; ++j) { if (str01[i - 1] == str02[j - 1]) { calculate[i][j] = calculate[i - 1][j - 1] + 1; } else if (calculate[i - 1][j] = calculate[i][j - 1]) { calculate[i][j] = calculate[i - 1][j]; } else { calculate[i][j] = calculate[i][j - 1]; } } } System.out.println(calculate[i - 1][j - 1]); } public static void main(String[] args) { String[] str01 = { 1, 2, 3, a, b, c }; String[] str02 = { a, b, c, 1, 2, 3, a, b, c }; // String []str01 = {a,s,d,f}; // String []str02 = {a,d,f,s,d}; LCS.lcs_length(str01, str02); } } 2.The Triangle package com.kale.www; public class Triangle { /** * 求最大和 * * @param triangle * @param row */ static void max_sum(int triangle[][], int row) { for (int i = row - 2; i = 0; --i) { for (int j = 0; j = i; ++j) { if (triangle[i + 1][j] = triangle[i + 1][j + 1]) { triangle[i][j] += triangle[i + 1][j]; } else { triangle[i][j] += triangle[i + 1][j + 1]; } } } System.out.println(triangle[0][0]); } public static void main(String[] args) { int[][] triangle = { { 7 }, { 3, 8 }, { 8, 1, 0 }, { 2, 7, 4, 4 }, { 4, 5, 2, 6, 5 } }; Triangle.max_sum(triangle, triangle.length); } } 3.超级台阶 package com.kale.www; public class FootStep { static int max = 10; static int[] foot = new int[max]; /** * 超级台阶 * * @param n */ static void all_path(int n) { foot[1] = 0;