題意:赤裸裸的求最長公共序列。
算法思路:dp。
dp[i][j]指前i和j有多長的相同的個數。
代碼:
a#include <iostream> using namespace std; int dp[512][512]; int main() { char a[512],b[512]; int i,j; while(scanf("%s%s",&a,&b)!=EOF) { memset(dp,0,sizeof(dp)); int la,lb; la = strlen(a); lb = strlen(b); for(i = 1 ; i <= la ; i++) for(j = 1 ; j <= lb ; j++) { if(a[i-1] == b[j-1]) dp[i][j] = dp[i-1][j-1]+1; else { dp[i][j] = dp[i-1][j]>dp[i][j-1] ? dp[i-1][j]:dp[i][j-1]; } } cout<<dp[la][lb]<<endl; } return 0; }
直播概要: 隨着計算機的蓬勃發展,互聯網進入大數據和人工智能時代,爲了解決信息過載和長尾商品,推薦系統成爲唯一選擇,而面對不同的業務場景,爲了解決業務痛點,會根據不同的場景特點尋找不同的方法和手段來解決推薦中實際遇到的問題。在智慧家庭領域,
{"type":"doc","content":[{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"typ
{"type":"doc","content":[{"type":"blockquote","content":[{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null
{"type":"doc","content":[{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"blockq