search

spiralgo / algorithms

We voluntarily solve algorithm problems on this repo.
24 stars 7 forks source link

72. Edit Distance #335

Open ErdemT09 opened 3 years ago

ErdemT09 commented 3 years ago

https://leetcode.com/problems/edit-distance/

Varsayılan Kod:

class Solution {
    public int minDistance(String word1, String word2) {

    }
}

image image

ErdemT09 commented 3 years ago

In information theory, linguistics, and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other. ... Levenshtein distance may also be referred to as edit distance...

https://en.wikipedia.org/wiki/Levenshtein_distance

ErdemT09 commented 3 years ago

Tübitak 2012 Bilgisayar Olimpiyatından. image