weixin_44027021的博客

伯努利分布

weixin_44027021 — Wed, 16 Nov 2022 19:51:48 +0800

伯努利分布

LeetCode 764. 最大加号标志

weixin_44027021 — Thu, 10 Nov 2022 18:38:45 +0800

LeetCode第764题最大加号标志题解，动态规划的经典应用。

机器学习-吴恩达

weixin_44027021 — Wed, 09 Mar 2022 15:53:35 +0800

机器学习-吴恩达笔记

18_最长公共子串

weixin_44027021 — Sat, 11 Dec 2021 18:55:08 +0800

#include #include #include #include using namespace std; const int MAXI = 1e4; int dp[MAXI][MAXI]; int LCS(char* s1, char* s2) { int ans = 0; for (int i = 1; i <= strlen(s1); i++

17_最长公共子序列

weixin_44027021 — Sat, 11 Dec 2021 17:04:31 +0800

#include #include #include #include using namespace std; const int MAXI = 1e4; int dp[MAXI][MAXI]; void LCS(char* s1, char* s2) { for (int i = 1; i <= strlen(s1); i++) for (i

16_归并排序

weixin_44027021 — Sat, 11 Dec 2021 16:21:03 +0800

#include #include #include #include using namespace std; const int MAXI = 1e4; void merge(int* array, int low, int mid, int high) { if (low >= high) { return; } int*

15_二分查找

weixin_44027021 — Tue, 07 Dec 2021 21:34:49 +0800

#include #include const int MAXN = 1e4; int array[MAXN]; int binarySearch(int *arr, int key, int length) { int left = 0; //左边界 int right = length - 1; //右边界 while (left <= right) { int middle = (left + right) / 2;

14_斐波那契数列的非递归写法

weixin_44027021 — Tue, 07 Dec 2021 16:39:08 +0800

#include #include typedef long long ll; const int MAXN = 1e4; ll a[MAXN]; void get_Fibonacci(ll n) { for (int i = 0; i < MAXN; i++) { if (i <= 1) a[i] = 1; else a[i] = a[i - 1] + a[i - 2]; } } int main() { ge

13_斐波那契数列的递归写法

weixin_44027021 — Tue, 07 Dec 2021 16:34:40 +0800

#include #include typedef long long ll; ll Fibonacci(ll n) { if (n <= 1) return 1; return Fibonacci(n - 1) + Fibonacci(n - 2); } int main() { ll n; printf("你要斐波那契数列的第几项？\n"); scanf("%lld", &n); printf("%lld",

12_Hanio(汉诺塔)

weixin_44027021 — Tue, 07 Dec 2021 16:21:06 +0800

#include #include void move(char no, char from, char to) { printf("将 %d 号盘子从 %c 移动到 %c\n", no, from, to); } void hanoi(int n, char p1, char p2, char p3) { if (n == 1) {//只有一层的情况 move(n, p1, p3); return; } //将p3看作中

11_普通快速排序

weixin_44027021 — Sun, 05 Dec 2021 10:48:15 +0800

#include #include #define MAXZISE 100 #define ElemType int int Partition(ElemType A[], int low, int high) { ElemType pivot = A[low]; while (low < high) { while (low < high && A[high] >= piv

10_优化KMP算法

weixin_44027021 — Fri, 03 Dec 2021 14:41:04 +0800

/** * @Author: 郑潮安yyds * @Time: 2021/12/2 22:15. * @Filename: Kmp.cpp * @Software: CLion */ #include #include #define MaxSize 1000 using namespace std; typedef struct { char data[MaxSize]; int length; /

9_普通KMP算法

weixin_44027021 — Fri, 03 Dec 2021 14:06:33 +0800

8_Floyd算法

weixin_44027021 — Thu, 02 Dec 2021 21:36:33 +0800

/** * @Author: 郑潮安yyds * @Time: 2021/12/2 18:47. * @Filename: Floyd.cpp * @Software: CLion */ #include #include #define MAXN 100 #define INF 0x3f3f3f3f typedef struct struct_graph { char vexs[MAXN]; int vexnum;//顶

7_Dijkstra算法

weixin_44027021 — Thu, 02 Dec 2021 19:18:27 +0800

/** * @Author: 郑潮安yyds * @Time: 2021/12/2 18:47. * @Filename: Dijkstra.cpp * @Software: CLion */ #include #include #include #include using namespace std; const int N = 100;//城市的个数可修改 const int

6_Kruskal算法

weixin_44027021 — Thu, 02 Dec 2021 18:19:48 +0800

/** * @Author: 郑潮安yyds * @Time: 2021/12/2 16:30. * @Filename: union_find_set.cpp * @Software: CLion */ #include using namespace std; const int MAXN = 1060; int n, m, conedEdge, sumLength, s[MAXN], height[MAXN]; int usedEdgeIndex[MAX

5_Prim算法

weixin_44027021 — Thu, 02 Dec 2021 16:24:34 +0800

/** * @Author: 郑潮安yyds * @Time: 2021/12/2 15:24. * @Filename: Prim.cpp * @Software: CLion */ //最小生成树——Prime //邻接矩阵无向图 /* *邮箱：unique_powerhouse@qq.com *blog:https://me.youkuaiyun.com/hzf0701 *注：文章若有任何问题请私信我或评论区留言，谢谢支持。 * */ #include //

常用代码模板系列文章目录

weixin_44027021 — Tue, 30 Nov 2021 15:51:39 +0800

文章目录0、文件输入1、高精度加2、高精度乘3、快读 0、文件输入 freopen("C:\\Users\\30414\\Desktop\\洛谷新生\\input.in","r",stdin); 1、高精度加 #include #include using namespace std; char aa[64], bb[64], cc[64]; int a[64], b[64], c[64]; int ans[64 * 3]; int add

4_输入快读

weixin_44027021 — Tue, 30 Nov 2021 15:33:16 +0800

int read(){//快读 int x=0,f=1; char c=getchar(); while(c<'0'||c>'9'){ if(c=='-') f=-1; c=getchar(); } while(c>='0'&&c<='9'){ x=x*10+c-'0'; c=getchar(); } return x*f; }

2_高精度加

weixin_44027021 — Tue, 30 Nov 2021 15:31:44 +0800

//高精度加 #include #include using namespace std; char aa[64], bb[64], cc[64]; int a[64], b[64], c[64]; int ans[64 * 3]; int add() { int len_a = strlen(aa); int len_b = strlen(bb); int len_c = strlen(cc); int tt