摘要：
Given two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a word:a) Insert a characterb) Delete a characterc) Replace a character自然语言处理（NLP）中，有一个基本问题就是求两个字符串的minimal Edit Dist 阅读全文
摘要：
Implement strStr().Returns a pointer to the first occurrence of needle in haystack, ornullif needle is not part of haystack.KMP算法！ 1 class Solution { ... 阅读全文