int m = s1.length(); int n = s2.length(); int[][] dp = new int[n + 1][m + 1]; for (int i = 0; i <= m; i++) { for (int j = 0; j <= n; j++) { dp[i][j] = 0; } }
相关推荐
招聘动态
查看更多
26届实习生双选会报名开启
26届实习软件笔试必刷题单