ForHeart
ForHeart
全部文章
分类
归档
标签
去牛客网
登录
/
注册
ForHeart的博客
TA的专栏
153篇文章
31人订阅
进阶高级测试工程师
142篇文章
1443人学习
AI自动测试化入门到精通
11篇文章
912人学习
全部文章
(共156篇)
题解 | 最长回文子序列
s = input() n = len(s) dp = [[0 for _ in range(n)] for _ in range(n)] #dp[i][j]表示i,j区间内容最长回文子串 for i in range(n-1,-1,-1): dp[i][i] =1 for j in...
2025-03-17
0
83
题解 | 滑雪
n, m = map(int, input().split()) arr = [] mat = [] dp = [[1 for _ in range(m)] for x in range(n)] for _ in range(n): arr = list(map(int, input().s...
2025-03-16
0
67
题解 | 合唱队形
import sys n = int(input()) arr = list(map(int,input().split())) rarr = arr[::-1] dpn = [1 for _ in range(n)] dpm = [1 for _ in range(n)] for i in ...
2025-03-16
0
68
题解 | 拦截导弹
#最长递减子序列。 n = int(input()) arr = list(map(int,input().split())) dp = [1 for _ in range(n)] dp1 = [1]*n for i in range(1,n): for j in range(i): ...
2025-03-16
0
89
题解 | 最小花费爬楼梯
n = int(input()) cost=list(map(int, input().split())) #贪心算和动态规划 dp0 = dp1 =0 for i in range(2,n+1): dp = min(dp0+cost[i-2],dp1+cost[i-1]) dp0...
2025-03-16
0
60
题解 | 斐波那契数列
n = int(input()) a,b =1,1 if n>=3: for i in range(3,n+1): a,b = b,a+b print(b) else: print(1)
2025-03-16
0
55
题解 | 【模板】01背包
n,v = map(int,input().split()) vol = [] weight = [] for _ in range(n): vi, wi = map(int, input().split()) vol.append(vi) weight.append(w...
2025-03-16
0
69
题解 | 最长上升子序列(一)
def func(n, arr): dp = [1] * n for i in range(1, n): for j in range(i): if arr[i] > arr[j]: dp[i] = ma...
2025-03-15
0
71
题解 | 损失函数
import numpy as np def calculate_loss(real_values, predicted_values, delta): mse = np.mean((real_values - predicted_values) ** 2) mae = np.m...
2025-03-04
0
60
题解 | 异常值与缺失值
import numpy as np def preprocess_data(): n=(int)(input()) li=[] for i in range(n): num=float(input()) li.append(num) ...
2025-03-04
0
87
首页
上一页
1
2
3
4
5
6
7
8
9
10
下一页
末页