Sunday, June 1, 2014

Code Ganker: Regular Expression Matching -- LeetCode

Code Ganker: Regular Expression Matching -- LeetCode: 原题链接: http://oj.leetcode.com/problems/regular-expression-matching/ 这个题目比较常见，但是难度还是比较大的。我们先来看看brute force怎么解决。基本思路就是先看字符串s和p的从i和j开始的子串是否匹配，...
Posted by at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)