Pagini recente » Diferente pentru algoritmul-lui-euclid intre reviziile 22 si 26 | Istoria paginii blog/finala-algoritmiada-2018 | Diferente pentru blog/algoritmiada-2018 intre reviziile 6 si 5 | Diferente pentru algoritmul-lui-euclid intre reviziile 16 si 26 | Diferente pentru blog/rolling-hash intre reviziile 6 si 5
Nu exista diferente intre titluri.
Diferente intre continut:
Deleting a character and appending another one corresponds to adding a number and subtracting a number in our hashing algorithm. The complexity of the algorithm is O(n).
If S and P are strings of digits and a is 10, our problem maps to finding numbers in a string of digits.
Let's go through an example.
Let's go through an example. If we S and P to be strings of digits and chose a to be 10, our problem maps to finding numbers in a string of digits.
== code(c) |
Let P = 53424, S = 3249753424234837 and a = 10
Nu exista diferente intre securitate.
Topicul de forum nu a fost schimbat.
