-
# 高级动态规划
DP的题目，还是不能上手。一道题目，一道题目反复看题解，才能理解，现在就死办法，几道题反复刷反复写，增加题感。
```
function DP();
dp = [][] # 二维情况
for i = 0 .. M {
for j = 0 .. N {
dp[i][j] = _Function(dp[i'][j']...)
…
-
### Idea Title
Add Examples for Algorithm it enhances the understanding of the problem
### Idea Description
Explanation with a example for all String Algorithms with enhance the understanding of th…
-
## Description:
Given two strings txt and pat of size N and M, where N > M. String txt and pat represent the text and pattern respectively. The task is to print all indexes of occurrences of pattern …
-
Hi I want to contribute to this project by adding some python algorithme.This is my first contribution so let me know if I did something wrong!
-
Hello @Kushal997-das . I would like to add solution of the problem [Shortest Palindrom](https://leetcode.com/problems/shortest-palindrome/) tagged as a hard problem on leetcode. I have solved it using…
-
I noticed something, YSI 5 is starting pretty slow unlike 4.x...
Its not the main problem, main problem is that when player connects to the server and YSI is not initialised yet, server "crashes", an…
-
## BF 算法和 RK 算法
BF 算法中的 BF 是 Brute Force 的缩写，中文叫作暴力匹配算法，也叫朴素匹配算法。
### BF 算法
### 主串和模式串
我们在字符串 A 中查找字符串 B，那字符串 A 就是主串，字符串 B 就是模式串。
我们在主串中，检查起始位置分别是 0、1、2…n-m 且长度为 m 的 n-m+1 个子串，看有没有跟模式串匹配的。
…
-
# 第二十课
> 字符串
## 概念
是由零个或多个字符组成的有限序列。一般记为 `s = a1a2…an (0
-
mclow updated
13 years ago
-
Currently, our implementation of `Sequence.find` may end up requiring quadratic runtime. We should use the KMP Algorithm, a racket version is presented [here](https://www.cambridge.org/core/journals/j…